/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-e106359-m [2022-04-14 15:15:50,033 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 15:15:50,034 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 15:15:50,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 15:15:50,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 15:15:50,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 15:15:50,053 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 15:15:50,054 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 15:15:50,055 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 15:15:50,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 15:15:50,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 15:15:50,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 15:15:50,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 15:15:50,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 15:15:50,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 15:15:50,059 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 15:15:50,060 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 15:15:50,061 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 15:15:50,062 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 15:15:50,063 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 15:15:50,064 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 15:15:50,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 15:15:50,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 15:15:50,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 15:15:50,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 15:15:50,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 15:15:50,068 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 15:15:50,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 15:15:50,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 15:15:50,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 15:15:50,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 15:15:50,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 15:15:50,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 15:15:50,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 15:15:50,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 15:15:50,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 15:15:50,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 15:15:50,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 15:15:50,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 15:15:50,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 15:15:50,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 15:15:50,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 15:15:50,074 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-14 15:15:50,087 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 15:15:50,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 15:15:50,088 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 15:15:50,088 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 15:15:50,088 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 15:15:50,088 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 15:15:50,089 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 15:15:50,089 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 15:15:50,089 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 15:15:50,090 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 15:15:50,090 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 15:15:50,090 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 15:15:50,090 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 15:15:50,090 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 15:15:50,090 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 15:15:50,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 15:15:50,091 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 15:15:50,091 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 15:15:50,091 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 15:15:50,091 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 15:15:50,092 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 15:15:50,092 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 15:15:50,092 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 15:15:50,092 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 15:15:50,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:15:50,092 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 15:15:50,092 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 15:15:50,092 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 15:15:50,093 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 15:15:50,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 15:15:50,093 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 15:15:50,093 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 15:15:50,093 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 15:15:50,093 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-14 15:15:50,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 15:15:50,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 15:15:50,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 15:15:50,308 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 15:15:50,309 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 15:15:50,310 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-14 15:15:50,351 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff0e01b79/943bdd3ff7bf4614b03b968d5dbb15f6/FLAG001193249 [2022-04-14 15:15:50,741 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 15:15:50,742 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound100.c [2022-04-14 15:15:50,746 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff0e01b79/943bdd3ff7bf4614b03b968d5dbb15f6/FLAG001193249 [2022-04-14 15:15:50,758 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff0e01b79/943bdd3ff7bf4614b03b968d5dbb15f6 [2022-04-14 15:15:50,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 15:15:50,762 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 15:15:50,764 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 15:15:50,764 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 15:15:50,766 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 15:15:50,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:15:50" (1/1) ... [2022-04-14 15:15:50,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37ac211b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:15:50, skipping insertion in model container [2022-04-14 15:15:50,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:15:50" (1/1) ... [2022-04-14 15:15:50,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 15:15:50,785 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 15:15:50,917 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-14 15:15:50,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:15:50,963 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 15:15:50,973 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-14 15:15:51,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:15:51,020 INFO L208 MainTranslator]: Completed translation [2022-04-14 15:15:51,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:15:51 WrapperNode [2022-04-14 15:15:51,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 15:15:51,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 15:15:51,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 15:15:51,021 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 15:15:51,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:15:51" (1/1) ... [2022-04-14 15:15:51,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:15:51" (1/1) ... [2022-04-14 15:15:51,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:15:51" (1/1) ... [2022-04-14 15:15:51,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:15:51" (1/1) ... [2022-04-14 15:15:51,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:15:51" (1/1) ... [2022-04-14 15:15:51,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:15:51" (1/1) ... [2022-04-14 15:15:51,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:15:51" (1/1) ... [2022-04-14 15:15:51,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 15:15:51,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 15:15:51,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 15:15:51,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 15:15:51,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:15:51" (1/1) ... [2022-04-14 15:15:51,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:15:51,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:15:51,077 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-14 15:15:51,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 15:15:51,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 15:15:51,103 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 15:15:51,103 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 15:15:51,104 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 15:15:51,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-14 15:15:51,104 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 15:15:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 15:15:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 15:15:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 15:15:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 15:15:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-14 15:15:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 15:15:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 15:15:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 15:15:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 15:15:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 15:15:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 15:15:51,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 15:15:51,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 15:15:51,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 15:15:51,150 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 15:15:51,151 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 15:15:51,313 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 15:15:51,317 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 15:15:51,318 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-14 15:15:51,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:15:51 BoogieIcfgContainer [2022-04-14 15:15:51,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 15:15:51,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 15:15:51,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 15:15:51,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 15:15:51,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 03:15:50" (1/3) ... [2022-04-14 15:15:51,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509cae17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:15:51, skipping insertion in model container [2022-04-14 15:15:51,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:15:51" (2/3) ... [2022-04-14 15:15:51,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509cae17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:15:51, skipping insertion in model container [2022-04-14 15:15:51,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:15:51" (3/3) ... [2022-04-14 15:15:51,324 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound100.c [2022-04-14 15:15:51,326 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 15:15:51,327 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 15:15:51,353 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 15:15:51,358 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 15:15:51,358 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 15:15:51,374 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-14 15:15:51,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-14 15:15:51,377 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:15:51,377 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:15:51,377 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:15:51,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:15:51,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 1 times [2022-04-14 15:15:51,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:15:51,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095733953] [2022-04-14 15:15:51,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:15:51,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:15:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:15:51,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:15:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:15:51,568 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-14 15:15:51,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-14 15:15:51,569 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-14 15:15:51,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:15:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:15:51,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-14 15:15:51,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-14 15:15:51,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-14 15:15:51,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-14 15:15:51,585 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-14 15:15:51,585 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-14 15:15:51,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-14 15:15:51,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-14 15:15:51,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret7 := main(); {42#true} is VALID [2022-04-14 15:15:51,586 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-14 15:15:51,586 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-14 15:15:51,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-14 15:15:51,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-14 15:15:51,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-14 15:15:51,587 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-14 15:15:51,587 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-14 15:15:51,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-14 15:15:51,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-14 15:15:51,588 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-14 15:15:51,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-14 15:15:51,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-14 15:15:51,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-14 15:15:51,590 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-14 15:15:51,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:15:51,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095733953] [2022-04-14 15:15:51,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095733953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:15:51,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:15:51,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 15:15:51,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633131345] [2022-04-14 15:15:51,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:15:51,598 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-14 15:15:51,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:15:51,602 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-14 15:15:51,627 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-14 15:15:51,628 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 15:15:51,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:15:51,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 15:15:51,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 15:15:51,648 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-14 15:15:55,934 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-14 15:16:00,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:00,583 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-04-14 15:16:00,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 15:16:00,583 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-14 15:16:00,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:16:00,584 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-14 15:16:00,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-14 15:16:00,591 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-14 15:16:00,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-14 15:16:00,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-14 15:16:00,738 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-14 15:16:00,751 INFO L225 Difference]: With dead ends: 70 [2022-04-14 15:16:00,751 INFO L226 Difference]: Without dead ends: 35 [2022-04-14 15:16:00,753 INFO L912 BasicCegarLoop]: 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-14 15:16:00,755 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-14 15:16:00,756 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-14 15:16:00,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-14 15:16:00,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-14 15:16:00,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:16:00,779 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-14 15:16:00,779 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-14 15:16:00,779 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-14 15:16:00,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:00,784 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-14 15:16:00,784 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-14 15:16:00,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:00,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:00,785 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-14 15:16:00,785 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-14 15:16:00,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:00,788 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-14 15:16:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-14 15:16:00,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:00,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:00,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:16:00,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:16:00,790 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-14 15:16:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-14 15:16:00,793 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-14 15:16:00,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:16:00,793 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-14 15:16:00,793 INFO L479 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-14 15:16:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-14 15:16:00,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-14 15:16:00,794 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:16:00,794 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:16:00,794 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 15:16:00,794 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:16:00,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:16:00,795 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 1 times [2022-04-14 15:16:00,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:16:00,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75636763] [2022-04-14 15:16:00,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:00,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:16:00,827 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:16:00,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1202389466] [2022-04-14 15:16:00,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:00,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:16:00,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:16:00,833 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:16:00,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-14 15:16:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:00,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 15:16:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:00,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:16:01,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {274#true} is VALID [2022-04-14 15:16:01,021 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-14 15:16:01,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:01,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {282#(<= ~counter~0 0)} {274#true} #102#return; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:01,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {282#(<= ~counter~0 0)} call #t~ret7 := main(); {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:01,022 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-14 15:16:01,023 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-14 15:16:01,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#(<= ~counter~0 0)} ~cond := #in~cond; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:01,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#(<= ~counter~0 0)} assume !(0 == ~cond); {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:01,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:01,025 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {282#(<= ~counter~0 0)} {282#(<= ~counter~0 0)} #82#return; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:01,025 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-14 15:16:01,026 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-14 15:16:01,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {316#(<= |main_#t~post5| 0)} assume !(#t~post5 < 100);havoc #t~post5; {275#false} is VALID [2022-04-14 15:16:01,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {275#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {275#false} is VALID [2022-04-14 15:16:01,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {275#false} assume !(#t~post6 < 100);havoc #t~post6; {275#false} is VALID [2022-04-14 15:16:01,027 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-14 15:16:01,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {275#false} ~cond := #in~cond; {275#false} is VALID [2022-04-14 15:16:01,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#false} assume 0 == ~cond; {275#false} is VALID [2022-04-14 15:16:01,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-04-14 15:16:01,028 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-14 15:16:01,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:16:01,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:16:01,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75636763] [2022-04-14 15:16:01,029 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:16:01,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202389466] [2022-04-14 15:16:01,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202389466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:16:01,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:16:01,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 15:16:01,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68862402] [2022-04-14 15:16:01,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:16:01,035 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-14 15:16:01,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:16:01,035 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-14 15:16:01,050 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-14 15:16:01,050 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 15:16:01,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:16:01,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 15:16:01,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 15:16:01,052 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-14 15:16:03,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:03,796 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-14 15:16:03,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 15:16:03,796 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-14 15:16:03,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:16:03,797 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-14 15:16:03,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-14 15:16:03,799 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-14 15:16:03,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-14 15:16:03,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-14 15:16:03,872 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-14 15:16:03,873 INFO L225 Difference]: With dead ends: 55 [2022-04-14 15:16:03,873 INFO L226 Difference]: Without dead ends: 36 [2022-04-14 15:16:03,874 INFO L912 BasicCegarLoop]: 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-14 15:16:03,875 INFO L913 BasicCegarLoop]: 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-14 15:16:03,875 INFO L914 BasicCegarLoop]: 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-14 15:16:03,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-14 15:16:03,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-14 15:16:03,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:16:03,882 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-14 15:16:03,882 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-14 15:16:03,882 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-14 15:16:03,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:03,884 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-14 15:16:03,884 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-14 15:16:03,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:03,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:03,885 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-14 15:16:03,885 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-14 15:16:03,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:03,887 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-14 15:16:03,887 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-14 15:16:03,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:03,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:03,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:16:03,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:16:03,888 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-14 15:16:03,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-14 15:16:03,890 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-14 15:16:03,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:16:03,890 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-14 15:16:03,891 INFO L479 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-14 15:16:03,891 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-14 15:16:03,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 15:16:03,891 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:16:03,891 INFO L499 BasicCegarLoop]: 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-14 15:16:03,910 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-14 15:16:04,110 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:16:04,110 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:16:04,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:16:04,111 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 1 times [2022-04-14 15:16:04,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:16:04,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432343880] [2022-04-14 15:16:04,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:04,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:16:04,125 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:16:04,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1320707087] [2022-04-14 15:16:04,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:04,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:16:04,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:16:04,137 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:16:04,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-14 15:16:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:04,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:16:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:04,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:16:04,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2022-04-14 15:16:04,309 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-14 15:16:04,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:04,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#(<= ~counter~0 0)} {546#true} #102#return; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:04,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#(<= ~counter~0 0)} call #t~ret7 := main(); {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:04,310 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-14 15:16:04,310 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-14 15:16:04,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#(<= ~counter~0 0)} ~cond := #in~cond; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:04,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#(<= ~counter~0 0)} assume !(0 == ~cond); {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:04,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:04,312 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#(<= ~counter~0 0)} {554#(<= ~counter~0 0)} #82#return; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:04,312 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-14 15:16:04,313 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-14 15:16:04,313 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-14 15:16:04,313 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-14 15:16:04,314 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-14 15:16:04,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {598#(<= |main_#t~post6| 1)} assume !(#t~post6 < 100);havoc #t~post6; {547#false} is VALID [2022-04-14 15:16:04,314 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-14 15:16:04,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2022-04-14 15:16:04,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2022-04-14 15:16:04,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {547#false} assume !false; {547#false} is VALID [2022-04-14 15:16:04,315 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-14 15:16:04,315 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:16:04,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:16:04,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432343880] [2022-04-14 15:16:04,315 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:16:04,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320707087] [2022-04-14 15:16:04,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320707087] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:16:04,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:16:04,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:16:04,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695500171] [2022-04-14 15:16:04,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:16:04,316 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-14 15:16:04,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:16:04,316 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-14 15:16:04,329 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-14 15:16:04,329 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:16:04,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:16:04,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:16:04,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:16:04,330 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-14 15:16:08,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:08,746 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-14 15:16:08,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:16:08,747 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-14 15:16:08,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:16:08,747 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-14 15:16:08,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-14 15:16:08,751 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-14 15:16:08,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-14 15:16:08,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-14 15:16:08,801 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-14 15:16:08,802 INFO L225 Difference]: With dead ends: 49 [2022-04-14 15:16:08,802 INFO L226 Difference]: Without dead ends: 40 [2022-04-14 15:16:08,802 INFO L912 BasicCegarLoop]: 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-14 15:16:08,803 INFO L913 BasicCegarLoop]: 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-14 15:16:08,804 INFO L914 BasicCegarLoop]: 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-14 15:16:08,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-14 15:16:08,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-14 15:16:08,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:16:08,811 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-14 15:16:08,811 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-14 15:16:08,811 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-14 15:16:08,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:08,813 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-14 15:16:08,813 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-14 15:16:08,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:08,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:08,813 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-14 15:16:08,814 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-14 15:16:08,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:08,815 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-14 15:16:08,815 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-14 15:16:08,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:08,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:08,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:16:08,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:16:08,816 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-14 15:16:08,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-04-14 15:16:08,818 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2022-04-14 15:16:08,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:16:08,818 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-04-14 15:16:08,818 INFO L479 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-14 15:16:08,818 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-04-14 15:16:08,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 15:16:08,818 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:16:08,818 INFO L499 BasicCegarLoop]: 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-14 15:16:08,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-14 15:16:09,027 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-14 15:16:09,028 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:16:09,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:16:09,029 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 1 times [2022-04-14 15:16:09,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:16:09,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937326009] [2022-04-14 15:16:09,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:09,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:16:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:09,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:16:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:09,197 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-14 15:16:09,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-14 15:16:09,197 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-14 15:16:09,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:16:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:09,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-14 15:16:09,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-14 15:16:09,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-14 15:16:09,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-14 15:16:09,204 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-14 15:16:09,204 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-14 15:16:09,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-14 15:16:09,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-14 15:16:09,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret7 := main(); {822#true} is VALID [2022-04-14 15:16:09,206 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-14 15:16:09,206 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-14 15:16:09,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-14 15:16:09,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-14 15:16:09,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-14 15:16:09,207 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-14 15:16:09,210 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-14 15:16:09,210 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-14 15:16:09,211 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-14 15:16:09,212 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-14 15:16:09,212 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-14 15:16:09,213 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-14 15:16:09,214 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-14 15:16:09,214 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-14 15:16:09,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {834#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {823#false} is VALID [2022-04-14 15:16:09,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-14 15:16:09,215 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-14 15:16:09,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:16:09,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937326009] [2022-04-14 15:16:09,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937326009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:16:09,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:16:09,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-14 15:16:09,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272254130] [2022-04-14 15:16:09,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:16:09,216 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-14 15:16:09,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:16:09,217 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-14 15:16:09,238 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-14 15:16:09,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 15:16:09,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:16:09,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 15:16:09,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-14 15:16:09,239 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-14 15:16:11,556 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:16:15,549 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:16:26,924 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:16:29,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:29,578 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-04-14 15:16:29,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 15:16:29,578 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-14 15:16:29,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:16:29,578 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-14 15:16:29,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-14 15:16:29,580 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-14 15:16:29,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-14 15:16:29,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2022-04-14 15:16:29,743 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-14 15:16:29,744 INFO L225 Difference]: With dead ends: 72 [2022-04-14 15:16:29,744 INFO L226 Difference]: Without dead ends: 51 [2022-04-14 15:16:29,745 INFO L912 BasicCegarLoop]: 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-14 15:16:29,745 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 37 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s 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, 13.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:16:29,745 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 207 Invalid, 2 Unknown, 0 Unchecked, 13.1s Time] [2022-04-14 15:16:29,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-14 15:16:29,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-14 15:16:29,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:16:29,757 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-14 15:16:29,757 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-14 15:16:29,758 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-14 15:16:29,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:29,760 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-14 15:16:29,760 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-14 15:16:29,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:29,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:29,761 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-14 15:16:29,761 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-14 15:16:29,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:29,763 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-14 15:16:29,763 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-14 15:16:29,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:29,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:29,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:16:29,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:16:29,764 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-14 15:16:29,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-04-14 15:16:29,765 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2022-04-14 15:16:29,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:16:29,765 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-04-14 15:16:29,766 INFO L479 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-14 15:16:29,766 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-14 15:16:29,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 15:16:29,766 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:16:29,766 INFO L499 BasicCegarLoop]: 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-14 15:16:29,766 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-14 15:16:29,766 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:16:29,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:16:29,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1701877900, now seen corresponding path program 1 times [2022-04-14 15:16:29,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:16:29,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083676090] [2022-04-14 15:16:29,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:29,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:16:29,776 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:16:29,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1644419731] [2022-04-14 15:16:29,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:29,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:16:29,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:16:29,777 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:16:29,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-14 15:16:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:29,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:16:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:29,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:16:29,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-14 15:16:29,932 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-14 15:16:29,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:29,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1145#(<= ~counter~0 0)} {1137#true} #102#return; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:29,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {1145#(<= ~counter~0 0)} call #t~ret7 := main(); {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:29,933 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-14 15:16:29,934 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-14 15:16:29,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {1145#(<= ~counter~0 0)} ~cond := #in~cond; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:29,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {1145#(<= ~counter~0 0)} assume !(0 == ~cond); {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:29,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:29,937 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1145#(<= ~counter~0 0)} {1145#(<= ~counter~0 0)} #82#return; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:29,937 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-14 15:16:29,937 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-14 15:16:29,938 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-14 15:16:29,938 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-14 15:16:29,938 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-14 15:16:29,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {1189#(<= |main_#t~post5| 1)} assume !(#t~post5 < 100);havoc #t~post5; {1138#false} is VALID [2022-04-14 15:16:29,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1138#false} is VALID [2022-04-14 15:16:29,939 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 100);havoc #t~post6; {1138#false} is VALID [2022-04-14 15:16:29,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-14 15:16:29,939 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-14 15:16:29,939 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-14 15:16:29,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-14 15:16:29,939 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-14 15:16:29,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:16:30,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-14 15:16:30,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-14 15:16:30,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-14 15:16:30,074 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-14 15:16:30,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 100);havoc #t~post6; {1138#false} is VALID [2022-04-14 15:16:30,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1138#false} is VALID [2022-04-14 15:16:30,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {1138#false} is VALID [2022-04-14 15:16:30,084 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-14 15:16:30,084 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-14 15:16:30,084 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-14 15:16:30,085 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-14 15:16:30,085 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-14 15:16:30,086 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1137#true} {1243#(< ~counter~0 99)} #82#return; {1243#(< ~counter~0 99)} is VALID [2022-04-14 15:16:30,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {1137#true} assume true; {1137#true} is VALID [2022-04-14 15:16:30,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {1137#true} assume !(0 == ~cond); {1137#true} is VALID [2022-04-14 15:16:30,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {1137#true} ~cond := #in~cond; {1137#true} is VALID [2022-04-14 15:16:30,086 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-14 15:16:30,087 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-14 15:16:30,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {1243#(< ~counter~0 99)} call #t~ret7 := main(); {1243#(< ~counter~0 99)} is VALID [2022-04-14 15:16:30,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1243#(< ~counter~0 99)} {1137#true} #102#return; {1243#(< ~counter~0 99)} is VALID [2022-04-14 15:16:30,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {1243#(< ~counter~0 99)} assume true; {1243#(< ~counter~0 99)} is VALID [2022-04-14 15:16:30,088 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-14 15:16:30,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-14 15:16:30,088 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-14 15:16:30,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:16:30,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083676090] [2022-04-14 15:16:30,089 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:16:30,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644419731] [2022-04-14 15:16:30,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644419731] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:16:30,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:16:30,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-14 15:16:30,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69224691] [2022-04-14 15:16:30,089 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:16:30,090 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-14 15:16:30,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:16:30,090 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-14 15:16:30,116 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-14 15:16:30,117 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:16:30,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:16:30,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:16:30,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-14 15:16:30,117 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-14 15:16:41,000 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-14 15:16:44,053 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-14 15:16:46,097 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-14 15:16:47,453 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:16:47,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:47,999 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2022-04-14 15:16:47,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 15:16:47,999 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-14 15:16:47,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:16:48,000 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-14 15:16:48,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2022-04-14 15:16:48,002 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-14 15:16:48,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2022-04-14 15:16:48,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 137 transitions. [2022-04-14 15:16:48,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:16:48,115 INFO L225 Difference]: With dead ends: 108 [2022-04-14 15:16:48,115 INFO L226 Difference]: Without dead ends: 89 [2022-04-14 15:16:48,116 INFO L912 BasicCegarLoop]: 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-14 15:16:48,116 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 64 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 24 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-04-14 15:16:48,116 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 247 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 77 Invalid, 3 Unknown, 0 Unchecked, 10.5s Time] [2022-04-14 15:16:48,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-14 15:16:48,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2022-04-14 15:16:48,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:16:48,135 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-14 15:16:48,135 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-14 15:16:48,136 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-14 15:16:48,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:48,139 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2022-04-14 15:16:48,139 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2022-04-14 15:16:48,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:48,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:48,139 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-14 15:16:48,140 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-14 15:16:48,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:48,142 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2022-04-14 15:16:48,143 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2022-04-14 15:16:48,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:48,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:48,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:16:48,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:16:48,152 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-14 15:16:48,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2022-04-14 15:16:48,155 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 23 [2022-04-14 15:16:48,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:16:48,155 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2022-04-14 15:16:48,155 INFO L479 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-14 15:16:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2022-04-14 15:16:48,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 15:16:48,155 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:16:48,156 INFO L499 BasicCegarLoop]: 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-14 15:16:48,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-14 15:16:48,375 WARN L460 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-14 15:16:48,376 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:16:48,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:16:48,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1564262277, now seen corresponding path program 1 times [2022-04-14 15:16:48,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:16:48,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955359793] [2022-04-14 15:16:48,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:48,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:16:48,388 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:16:48,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [272628709] [2022-04-14 15:16:48,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:48,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:16:48,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:16:48,390 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:16:48,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-14 15:16:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:48,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 15:16:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:48,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:16:48,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {1723#true} call ULTIMATE.init(); {1723#true} is VALID [2022-04-14 15:16:48,543 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-14 15:16:48,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {1731#(<= ~counter~0 0)} assume true; {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:48,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1731#(<= ~counter~0 0)} {1723#true} #102#return; {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:48,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {1731#(<= ~counter~0 0)} call #t~ret7 := main(); {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:48,544 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-14 15:16:48,545 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-14 15:16:48,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {1731#(<= ~counter~0 0)} ~cond := #in~cond; {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:48,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {1731#(<= ~counter~0 0)} assume !(0 == ~cond); {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:48,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {1731#(<= ~counter~0 0)} assume true; {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:48,546 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1731#(<= ~counter~0 0)} {1731#(<= ~counter~0 0)} #82#return; {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:48,546 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-14 15:16:48,546 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-14 15:16:48,547 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-14 15:16:48,547 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-14 15:16:48,547 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-14 15:16:48,548 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-14 15:16:48,548 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-14 15:16:48,548 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-14 15:16:48,548 INFO L290 TraceCheckUtils]: 19: Hoare triple {1785#(<= |main_#t~post6| 2)} assume !(#t~post6 < 100);havoc #t~post6; {1724#false} is VALID [2022-04-14 15:16:48,549 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-14 15:16:48,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {1724#false} ~cond := #in~cond; {1724#false} is VALID [2022-04-14 15:16:48,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {1724#false} assume 0 == ~cond; {1724#false} is VALID [2022-04-14 15:16:48,550 INFO L290 TraceCheckUtils]: 23: Hoare triple {1724#false} assume !false; {1724#false} is VALID [2022-04-14 15:16:48,550 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-14 15:16:48,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:16:48,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {1724#false} assume !false; {1724#false} is VALID [2022-04-14 15:16:48,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {1724#false} assume 0 == ~cond; {1724#false} is VALID [2022-04-14 15:16:48,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {1724#false} ~cond := #in~cond; {1724#false} is VALID [2022-04-14 15:16:48,674 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-14 15:16:48,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {1813#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {1724#false} is VALID [2022-04-14 15:16:48,674 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-14 15:16:48,674 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-14 15:16:48,675 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-14 15:16:48,675 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-14 15:16:48,675 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-14 15:16:48,676 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-14 15:16:48,676 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-14 15:16:48,676 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-14 15:16:48,677 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1723#true} {1837#(< ~counter~0 98)} #82#return; {1837#(< ~counter~0 98)} is VALID [2022-04-14 15:16:48,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {1723#true} assume true; {1723#true} is VALID [2022-04-14 15:16:48,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {1723#true} assume !(0 == ~cond); {1723#true} is VALID [2022-04-14 15:16:48,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {1723#true} ~cond := #in~cond; {1723#true} is VALID [2022-04-14 15:16:48,678 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-14 15:16:48,678 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-14 15:16:48,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {1837#(< ~counter~0 98)} call #t~ret7 := main(); {1837#(< ~counter~0 98)} is VALID [2022-04-14 15:16:48,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1837#(< ~counter~0 98)} {1723#true} #102#return; {1837#(< ~counter~0 98)} is VALID [2022-04-14 15:16:48,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {1837#(< ~counter~0 98)} assume true; {1837#(< ~counter~0 98)} is VALID [2022-04-14 15:16:48,680 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-14 15:16:48,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {1723#true} call ULTIMATE.init(); {1723#true} is VALID [2022-04-14 15:16:48,680 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-14 15:16:48,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:16:48,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955359793] [2022-04-14 15:16:48,680 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:16:48,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272628709] [2022-04-14 15:16:48,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272628709] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:16:48,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:16:48,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-14 15:16:48,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743998530] [2022-04-14 15:16:48,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:16:48,681 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-14 15:16:48,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:16:48,681 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-14 15:16:48,703 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-14 15:16:48,703 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 15:16:48,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:16:48,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 15:16:48,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-14 15:16:48,704 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-14 15:16:51,577 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-14 15:16:54,682 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-14 15:17:02,994 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-14 15:17:10,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:10,570 INFO L93 Difference]: Finished difference Result 138 states and 183 transitions. [2022-04-14 15:17:10,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-14 15:17:10,570 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-14 15:17:10,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:17:10,570 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-14 15:17:10,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 166 transitions. [2022-04-14 15:17:10,573 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-14 15:17:10,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 166 transitions. [2022-04-14 15:17:10,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 166 transitions. [2022-04-14 15:17:10,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:17:10,702 INFO L225 Difference]: With dead ends: 138 [2022-04-14 15:17:10,702 INFO L226 Difference]: Without dead ends: 129 [2022-04-14 15:17:10,702 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-14 15:17:10,703 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 111 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 37 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2022-04-14 15:17:10,703 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 307 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 98 Invalid, 3 Unknown, 0 Unchecked, 12.3s Time] [2022-04-14 15:17:10,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-14 15:17:10,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 120. [2022-04-14 15:17:10,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:17:10,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 120 states, 69 states have (on average 1.289855072463768) internal successors, (89), 74 states have internal predecessors, (89), 40 states have call successors, (40), 11 states have call predecessors, (40), 10 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-14 15:17:10,743 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 120 states, 69 states have (on average 1.289855072463768) internal successors, (89), 74 states have internal predecessors, (89), 40 states have call successors, (40), 11 states have call predecessors, (40), 10 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-14 15:17:10,743 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 120 states, 69 states have (on average 1.289855072463768) internal successors, (89), 74 states have internal predecessors, (89), 40 states have call successors, (40), 11 states have call predecessors, (40), 10 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-14 15:17:10,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:10,747 INFO L93 Difference]: Finished difference Result 129 states and 169 transitions. [2022-04-14 15:17:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 169 transitions. [2022-04-14 15:17:10,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:10,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:10,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 69 states have (on average 1.289855072463768) internal successors, (89), 74 states have internal predecessors, (89), 40 states have call successors, (40), 11 states have call predecessors, (40), 10 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) Second operand 129 states. [2022-04-14 15:17:10,748 INFO L87 Difference]: Start difference. First operand has 120 states, 69 states have (on average 1.289855072463768) internal successors, (89), 74 states have internal predecessors, (89), 40 states have call successors, (40), 11 states have call predecessors, (40), 10 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) Second operand 129 states. [2022-04-14 15:17:10,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:10,751 INFO L93 Difference]: Finished difference Result 129 states and 169 transitions. [2022-04-14 15:17:10,752 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 169 transitions. [2022-04-14 15:17:10,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:10,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:10,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:17:10,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:17:10,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 69 states have (on average 1.289855072463768) internal successors, (89), 74 states have internal predecessors, (89), 40 states have call successors, (40), 11 states have call predecessors, (40), 10 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-14 15:17:10,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 164 transitions. [2022-04-14 15:17:10,756 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 164 transitions. Word has length 24 [2022-04-14 15:17:10,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:17:10,756 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 164 transitions. [2022-04-14 15:17:10,756 INFO L479 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-14 15:17:10,756 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 164 transitions. [2022-04-14 15:17:10,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 15:17:10,756 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:17:10,756 INFO L499 BasicCegarLoop]: 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-14 15:17:10,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-14 15:17:10,971 WARN L460 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-14 15:17:10,971 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:17:10,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:17:10,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1562772727, now seen corresponding path program 1 times [2022-04-14 15:17:10,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:17:10,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891578449] [2022-04-14 15:17:10,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:10,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:17:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:11,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:17:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:11,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {2533#(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; {2519#true} is VALID [2022-04-14 15:17:11,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {2519#true} assume true; {2519#true} is VALID [2022-04-14 15:17:11,144 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2519#true} {2519#true} #102#return; {2519#true} is VALID [2022-04-14 15:17:11,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:17:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:11,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {2519#true} ~cond := #in~cond; {2519#true} is VALID [2022-04-14 15:17:11,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {2519#true} assume !(0 == ~cond); {2519#true} is VALID [2022-04-14 15:17:11,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {2519#true} assume true; {2519#true} is VALID [2022-04-14 15:17:11,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2519#true} {2519#true} #82#return; {2519#true} is VALID [2022-04-14 15:17:11,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {2519#true} call ULTIMATE.init(); {2533#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:17:11,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {2533#(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; {2519#true} is VALID [2022-04-14 15:17:11,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {2519#true} assume true; {2519#true} is VALID [2022-04-14 15:17:11,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2519#true} {2519#true} #102#return; {2519#true} is VALID [2022-04-14 15:17:11,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {2519#true} call #t~ret7 := main(); {2519#true} is VALID [2022-04-14 15:17:11,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {2519#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2519#true} is VALID [2022-04-14 15:17:11,155 INFO L272 TraceCheckUtils]: 6: Hoare triple {2519#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2519#true} is VALID [2022-04-14 15:17:11,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {2519#true} ~cond := #in~cond; {2519#true} is VALID [2022-04-14 15:17:11,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {2519#true} assume !(0 == ~cond); {2519#true} is VALID [2022-04-14 15:17:11,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {2519#true} assume true; {2519#true} is VALID [2022-04-14 15:17:11,155 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2519#true} {2519#true} #82#return; {2519#true} is VALID [2022-04-14 15:17:11,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {2519#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2528#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:11,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {2528#(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; {2528#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:11,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {2528#(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; {2528#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:11,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {2528#(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; {2529#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-14 15:17:11,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {2529#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2529#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-14 15:17:11,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {2529#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 100);havoc #t~post5; {2529#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-14 15:17:11,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {2529#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2530#(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-14 15:17:11,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {2530#(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; {2530#(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-14 15:17:11,159 INFO L290 TraceCheckUtils]: 19: Hoare triple {2530#(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; {2530#(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-14 15:17:11,160 INFO L272 TraceCheckUtils]: 20: Hoare triple {2530#(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)); {2531#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:17:11,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {2531#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2532#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:17:11,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {2532#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2520#false} is VALID [2022-04-14 15:17:11,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {2520#false} assume !false; {2520#false} is VALID [2022-04-14 15:17:11,162 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-14 15:17:11,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:17:11,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891578449] [2022-04-14 15:17:11,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891578449] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:17:11,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515511431] [2022-04-14 15:17:11,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:11,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:17:11,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:17:11,163 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:17:11,164 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-14 15:17:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:11,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-14 15:17:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:11,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:17:11,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {2519#true} call ULTIMATE.init(); {2519#true} is VALID [2022-04-14 15:17:11,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {2519#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; {2519#true} is VALID [2022-04-14 15:17:11,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {2519#true} assume true; {2519#true} is VALID [2022-04-14 15:17:11,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2519#true} {2519#true} #102#return; {2519#true} is VALID [2022-04-14 15:17:11,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {2519#true} call #t~ret7 := main(); {2519#true} is VALID [2022-04-14 15:17:11,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {2519#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2519#true} is VALID [2022-04-14 15:17:11,493 INFO L272 TraceCheckUtils]: 6: Hoare triple {2519#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2519#true} is VALID [2022-04-14 15:17:11,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {2519#true} ~cond := #in~cond; {2519#true} is VALID [2022-04-14 15:17:11,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {2519#true} assume !(0 == ~cond); {2519#true} is VALID [2022-04-14 15:17:11,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {2519#true} assume true; {2519#true} is VALID [2022-04-14 15:17:11,494 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2519#true} {2519#true} #82#return; {2519#true} is VALID [2022-04-14 15:17:11,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {2519#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2528#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:11,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {2528#(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; {2528#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:11,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {2528#(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; {2528#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:11,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {2528#(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; {2579#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:11,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {2579#(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; {2579#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:11,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {2579#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {2579#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:11,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {2579#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2589#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-14 15:17:11,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {2589#(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; {2589#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-14 15:17:11,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {2589#(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; {2589#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-14 15:17:11,498 INFO L272 TraceCheckUtils]: 20: Hoare triple {2589#(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)); {2599#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:17:11,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {2599#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2603#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:17:11,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {2603#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2520#false} is VALID [2022-04-14 15:17:11,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {2520#false} assume !false; {2520#false} is VALID [2022-04-14 15:17:11,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-14 15:17:11,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:17:11,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {2520#false} assume !false; {2520#false} is VALID [2022-04-14 15:17:11,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {2603#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2520#false} is VALID [2022-04-14 15:17:11,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {2599#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2603#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:17:11,718 INFO L272 TraceCheckUtils]: 20: Hoare triple {2619#(< (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)); {2599#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:17:11,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {2619#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} assume !!(#t~post6 < 100);havoc #t~post6; {2619#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-14 15:17:11,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {2619#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2619#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-14 15:17:11,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {2629#(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); {2619#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-14 15:17:11,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {2629#(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; {2629#(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-14 15:17:11,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {2629#(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; {2629#(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-14 15:17:11,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {2639#(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; {2629#(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-14 15:17:11,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {2639#(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; {2639#(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-14 15:17:11,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {2639#(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; {2639#(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-14 15:17:11,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {2519#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2639#(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-14 15:17:11,734 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2519#true} {2519#true} #82#return; {2519#true} is VALID [2022-04-14 15:17:11,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {2519#true} assume true; {2519#true} is VALID [2022-04-14 15:17:11,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {2519#true} assume !(0 == ~cond); {2519#true} is VALID [2022-04-14 15:17:11,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {2519#true} ~cond := #in~cond; {2519#true} is VALID [2022-04-14 15:17:11,735 INFO L272 TraceCheckUtils]: 6: Hoare triple {2519#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2519#true} is VALID [2022-04-14 15:17:11,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {2519#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2519#true} is VALID [2022-04-14 15:17:11,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {2519#true} call #t~ret7 := main(); {2519#true} is VALID [2022-04-14 15:17:11,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2519#true} {2519#true} #102#return; {2519#true} is VALID [2022-04-14 15:17:11,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {2519#true} assume true; {2519#true} is VALID [2022-04-14 15:17:11,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {2519#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; {2519#true} is VALID [2022-04-14 15:17:11,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {2519#true} call ULTIMATE.init(); {2519#true} is VALID [2022-04-14 15:17:11,735 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-14 15:17:11,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515511431] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:17:11,735 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 15:17:11,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-14 15:17:11,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495814609] [2022-04-14 15:17:11,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 15:17:11,736 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-14 15:17:11,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:17:11,736 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-14 15:17:11,774 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-14 15:17:11,774 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-14 15:17:11,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:17:11,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-14 15:17:11,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-14 15:17:11,775 INFO L87 Difference]: Start difference. First operand 120 states and 164 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-14 15:17:18,789 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:17:25,029 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:17:28,945 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-14 15:17:31,985 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:17:36,957 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:17:38,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:17:40,960 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:17:43,728 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-14 15:17:45,878 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-14 15:17:50,152 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-14 15:17:52,283 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-14 15:17:54,417 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-14 15:18:12,843 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-14 15:18:19,255 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-14 15:18:21,261 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-14 15:18:23,264 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-14 15:18:25,269 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-14 15:18:32,845 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-14 15:18:38,229 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:18:45,423 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:19:02,183 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-14 15:19:10,434 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-14 15:19:17,618 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-14 15:19:19,772 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-14 15:19:21,878 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:19:23,983 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:19:39,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:19:39,980 INFO L93 Difference]: Finished difference Result 228 states and 336 transitions. [2022-04-14 15:19:39,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-14 15:19:39,980 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-14 15:19:39,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:19:39,981 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-14 15:19:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 190 transitions. [2022-04-14 15:19:39,984 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-14 15:19:39,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 190 transitions. [2022-04-14 15:19:39,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 190 transitions. [2022-04-14 15:19:40,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:19:40,810 INFO L225 Difference]: With dead ends: 228 [2022-04-14 15:19:40,810 INFO L226 Difference]: Without dead ends: 207 [2022-04-14 15:19:40,811 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=107, Invalid=398, Unknown=1, NotChecked=0, Total=506 [2022-04-14 15:19:40,811 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 59 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 150 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 76.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 77.6s IncrementalHoareTripleChecker+Time [2022-04-14 15:19:40,812 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 183 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 711 Invalid, 24 Unknown, 0 Unchecked, 77.6s Time] [2022-04-14 15:19:40,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-04-14 15:19:40,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 169. [2022-04-14 15:19:40,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:19:40,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 169 states, 98 states have (on average 1.2653061224489797) internal successors, (124), 105 states have internal predecessors, (124), 56 states have call successors, (56), 15 states have call predecessors, (56), 14 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-14 15:19:40,895 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 169 states, 98 states have (on average 1.2653061224489797) internal successors, (124), 105 states have internal predecessors, (124), 56 states have call successors, (56), 15 states have call predecessors, (56), 14 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-14 15:19:40,895 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 169 states, 98 states have (on average 1.2653061224489797) internal successors, (124), 105 states have internal predecessors, (124), 56 states have call successors, (56), 15 states have call predecessors, (56), 14 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-14 15:19:40,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:19:40,901 INFO L93 Difference]: Finished difference Result 207 states and 297 transitions. [2022-04-14 15:19:40,902 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 297 transitions. [2022-04-14 15:19:40,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:19:40,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:19:40,903 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 98 states have (on average 1.2653061224489797) internal successors, (124), 105 states have internal predecessors, (124), 56 states have call successors, (56), 15 states have call predecessors, (56), 14 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) Second operand 207 states. [2022-04-14 15:19:40,903 INFO L87 Difference]: Start difference. First operand has 169 states, 98 states have (on average 1.2653061224489797) internal successors, (124), 105 states have internal predecessors, (124), 56 states have call successors, (56), 15 states have call predecessors, (56), 14 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) Second operand 207 states. [2022-04-14 15:19:40,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:19:40,909 INFO L93 Difference]: Finished difference Result 207 states and 297 transitions. [2022-04-14 15:19:40,909 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 297 transitions. [2022-04-14 15:19:40,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:19:40,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:19:40,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:19:40,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:19:40,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 98 states have (on average 1.2653061224489797) internal successors, (124), 105 states have internal predecessors, (124), 56 states have call successors, (56), 15 states have call predecessors, (56), 14 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-14 15:19:40,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 230 transitions. [2022-04-14 15:19:40,915 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 230 transitions. Word has length 24 [2022-04-14 15:19:40,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:19:40,915 INFO L478 AbstractCegarLoop]: Abstraction has 169 states and 230 transitions. [2022-04-14 15:19:40,915 INFO L479 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-14 15:19:40,915 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 230 transitions. [2022-04-14 15:19:40,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-14 15:19:40,916 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:19:40,916 INFO L499 BasicCegarLoop]: 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-14 15:19:40,937 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-14 15:19:41,131 WARN L460 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-14 15:19:41,132 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:19:41,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:19:41,132 INFO L85 PathProgramCache]: Analyzing trace with hash -45171523, now seen corresponding path program 1 times [2022-04-14 15:19:41,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:19:41,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142777266] [2022-04-14 15:19:41,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:19:41,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:19:41,169 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:19:41,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1708953445] [2022-04-14 15:19:41,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:19:41,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:19:41,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:19:41,183 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-14 15:19:41,184 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-14 15:19:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:19:41,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 15:19:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:19:41,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:19:41,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {3710#true} call ULTIMATE.init(); {3710#true} is VALID [2022-04-14 15:19:41,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {3710#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; {3710#true} is VALID [2022-04-14 15:19:41,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {3710#true} assume true; {3710#true} is VALID [2022-04-14 15:19:41,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3710#true} {3710#true} #102#return; {3710#true} is VALID [2022-04-14 15:19:41,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {3710#true} call #t~ret7 := main(); {3710#true} is VALID [2022-04-14 15:19:41,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {3710#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {3710#true} is VALID [2022-04-14 15:19:41,414 INFO L272 TraceCheckUtils]: 6: Hoare triple {3710#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {3710#true} is VALID [2022-04-14 15:19:41,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {3710#true} ~cond := #in~cond; {3710#true} is VALID [2022-04-14 15:19:41,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {3710#true} assume !(0 == ~cond); {3710#true} is VALID [2022-04-14 15:19:41,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {3710#true} assume true; {3710#true} is VALID [2022-04-14 15:19:41,415 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3710#true} {3710#true} #82#return; {3710#true} is VALID [2022-04-14 15:19:41,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {3710#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {3748#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:19:41,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {3748#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3748#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:19:41,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {3748#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {3748#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:19:41,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {3748#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {3748#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:19:41,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {3748#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3748#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:19:41,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {3748#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {3748#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:19:41,417 INFO L272 TraceCheckUtils]: 17: Hoare triple {3748#(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)); {3710#true} is VALID [2022-04-14 15:19:41,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {3710#true} ~cond := #in~cond; {3710#true} is VALID [2022-04-14 15:19:41,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {3710#true} assume !(0 == ~cond); {3710#true} is VALID [2022-04-14 15:19:41,417 INFO L290 TraceCheckUtils]: 20: Hoare triple {3710#true} assume true; {3710#true} is VALID [2022-04-14 15:19:41,418 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3710#true} {3748#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #84#return; {3748#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:19:41,418 INFO L272 TraceCheckUtils]: 22: Hoare triple {3748#(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)); {3710#true} is VALID [2022-04-14 15:19:41,418 INFO L290 TraceCheckUtils]: 23: Hoare triple {3710#true} ~cond := #in~cond; {3710#true} is VALID [2022-04-14 15:19:41,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {3710#true} assume !(0 == ~cond); {3710#true} is VALID [2022-04-14 15:19:41,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {3710#true} assume true; {3710#true} is VALID [2022-04-14 15:19:41,418 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3710#true} {3748#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #86#return; {3748#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:19:41,419 INFO L272 TraceCheckUtils]: 27: Hoare triple {3748#(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)); {3797#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:19:41,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {3797#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3801#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:19:41,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {3801#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3711#false} is VALID [2022-04-14 15:19:41,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {3711#false} assume !false; {3711#false} is VALID [2022-04-14 15:19:41,420 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-14 15:19:41,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:19:41,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:19:41,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142777266] [2022-04-14 15:19:41,420 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:19:41,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708953445] [2022-04-14 15:19:41,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708953445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:19:41,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:19:41,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:19:41,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264691455] [2022-04-14 15:19:41,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:19:41,421 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-14 15:19:41,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:19:41,421 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-14 15:19:41,441 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-14 15:19:41,441 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:19:41,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:19:41,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:19:41,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:19:41,442 INFO L87 Difference]: Start difference. First operand 169 states and 230 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-14 15:19:47,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:19:47,149 INFO L93 Difference]: Finished difference Result 180 states and 239 transitions. [2022-04-14 15:19:47,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:19:47,149 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-14 15:19:47,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:19:47,149 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-14 15:19:47,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-14 15:19:47,150 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-14 15:19:47,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-14 15:19:47,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-14 15:19:47,211 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-14 15:19:47,213 INFO L225 Difference]: With dead ends: 180 [2022-04-14 15:19:47,214 INFO L226 Difference]: Without dead ends: 144 [2022-04-14 15:19:47,214 INFO L912 BasicCegarLoop]: 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-14 15:19:47,214 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:19:47,214 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-14 15:19:47,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-14 15:19:47,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-04-14 15:19:47,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:19:47,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 144 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 50 states have call successors, (50), 11 states have call predecessors, (50), 10 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-14 15:19:47,290 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 144 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 50 states have call successors, (50), 11 states have call predecessors, (50), 10 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-14 15:19:47,290 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 144 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 50 states have call successors, (50), 11 states have call predecessors, (50), 10 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-14 15:19:47,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:19:47,294 INFO L93 Difference]: Finished difference Result 144 states and 201 transitions. [2022-04-14 15:19:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 201 transitions. [2022-04-14 15:19:47,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:19:47,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:19:47,295 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 50 states have call successors, (50), 11 states have call predecessors, (50), 10 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) Second operand 144 states. [2022-04-14 15:19:47,295 INFO L87 Difference]: Start difference. First operand has 144 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 50 states have call successors, (50), 11 states have call predecessors, (50), 10 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) Second operand 144 states. [2022-04-14 15:19:47,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:19:47,298 INFO L93 Difference]: Finished difference Result 144 states and 201 transitions. [2022-04-14 15:19:47,298 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 201 transitions. [2022-04-14 15:19:47,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:19:47,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:19:47,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:19:47,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:19:47,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 50 states have call successors, (50), 11 states have call predecessors, (50), 10 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-14 15:19:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 201 transitions. [2022-04-14 15:19:47,303 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 201 transitions. Word has length 31 [2022-04-14 15:19:47,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:19:47,303 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 201 transitions. [2022-04-14 15:19:47,303 INFO L479 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-14 15:19:47,304 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 201 transitions. [2022-04-14 15:19:47,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-14 15:19:47,304 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:19:47,304 INFO L499 BasicCegarLoop]: 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-14 15:19:47,311 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-14 15:19:47,507 WARN L460 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-14 15:19:47,508 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:19:47,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:19:47,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1547125783, now seen corresponding path program 1 times [2022-04-14 15:19:47,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:19:47,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989711385] [2022-04-14 15:19:47,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:19:47,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:19:47,525 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:19:47,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [344429909] [2022-04-14 15:19:47,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:19:47,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:19:47,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:19:47,533 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-14 15:19:47,534 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-14 15:19:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:19:47,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:19:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:19:47,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:19:47,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {4568#true} call ULTIMATE.init(); {4568#true} is VALID [2022-04-14 15:19:47,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {4568#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; {4568#true} is VALID [2022-04-14 15:19:47,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {4568#true} assume true; {4568#true} is VALID [2022-04-14 15:19:47,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4568#true} {4568#true} #102#return; {4568#true} is VALID [2022-04-14 15:19:47,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {4568#true} call #t~ret7 := main(); {4568#true} is VALID [2022-04-14 15:19:47,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {4568#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {4568#true} is VALID [2022-04-14 15:19:47,736 INFO L272 TraceCheckUtils]: 6: Hoare triple {4568#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {4568#true} is VALID [2022-04-14 15:19:47,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {4568#true} ~cond := #in~cond; {4568#true} is VALID [2022-04-14 15:19:47,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {4568#true} assume !(0 == ~cond); {4568#true} is VALID [2022-04-14 15:19:47,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {4568#true} assume true; {4568#true} is VALID [2022-04-14 15:19:47,736 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4568#true} {4568#true} #82#return; {4568#true} is VALID [2022-04-14 15:19:47,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {4568#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {4606#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:19:47,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {4606#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4606#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:19:47,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {4606#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {4606#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:19:47,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {4606#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4606#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:19:47,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {4606#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4606#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:19:47,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {4606#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {4606#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:19:47,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {4606#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {4606#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:19:47,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {4606#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4606#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:19:47,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {4606#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {4606#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:19:47,740 INFO L272 TraceCheckUtils]: 20: Hoare triple {4606#(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)); {4568#true} is VALID [2022-04-14 15:19:47,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {4568#true} ~cond := #in~cond; {4568#true} is VALID [2022-04-14 15:19:47,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {4568#true} assume !(0 == ~cond); {4568#true} is VALID [2022-04-14 15:19:47,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {4568#true} assume true; {4568#true} is VALID [2022-04-14 15:19:47,741 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4568#true} {4606#(and (= main_~p~0 0) (= main_~h~0 0))} #84#return; {4606#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:19:47,741 INFO L272 TraceCheckUtils]: 25: Hoare triple {4606#(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)); {4568#true} is VALID [2022-04-14 15:19:47,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {4568#true} ~cond := #in~cond; {4568#true} is VALID [2022-04-14 15:19:47,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {4568#true} assume !(0 == ~cond); {4568#true} is VALID [2022-04-14 15:19:47,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {4568#true} assume true; {4568#true} is VALID [2022-04-14 15:19:47,742 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4568#true} {4606#(and (= main_~p~0 0) (= main_~h~0 0))} #86#return; {4606#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:19:47,742 INFO L272 TraceCheckUtils]: 30: Hoare triple {4606#(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)); {4664#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:19:47,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {4664#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4668#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:19:47,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {4668#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4569#false} is VALID [2022-04-14 15:19:47,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {4569#false} assume !false; {4569#false} is VALID [2022-04-14 15:19:47,744 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-14 15:19:47,744 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:19:47,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:19:47,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989711385] [2022-04-14 15:19:47,744 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:19:47,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344429909] [2022-04-14 15:19:47,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344429909] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:19:47,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:19:47,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:19:47,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522077257] [2022-04-14 15:19:47,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:19:47,745 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-14 15:19:47,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:19:47,745 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-14 15:19:47,766 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-14 15:19:47,767 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:19:47,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:19:47,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:19:47,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:19:47,767 INFO L87 Difference]: Start difference. First operand 144 states and 201 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-14 15:19:52,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:19:52,546 INFO L93 Difference]: Finished difference Result 185 states and 252 transitions. [2022-04-14 15:19:52,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:19:52,546 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-14 15:19:52,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:19:52,546 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-14 15:19:52,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-14 15:19:52,547 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-14 15:19:52,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-14 15:19:52,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-14 15:19:52,615 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-14 15:19:52,618 INFO L225 Difference]: With dead ends: 185 [2022-04-14 15:19:52,619 INFO L226 Difference]: Without dead ends: 180 [2022-04-14 15:19:52,619 INFO L912 BasicCegarLoop]: 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-14 15:19:52,619 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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, 1.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:19:52,619 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 156 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-14 15:19:52,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-14 15:19:52,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 164. [2022-04-14 15:19:52,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:19:52,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 164 states, 93 states have (on average 1.1935483870967742) internal successors, (111), 99 states have internal predecessors, (111), 56 states have call successors, (56), 15 states have call predecessors, (56), 14 states have return successors, (51), 49 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-14 15:19:52,699 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 164 states, 93 states have (on average 1.1935483870967742) internal successors, (111), 99 states have internal predecessors, (111), 56 states have call successors, (56), 15 states have call predecessors, (56), 14 states have return successors, (51), 49 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-14 15:19:52,700 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 164 states, 93 states have (on average 1.1935483870967742) internal successors, (111), 99 states have internal predecessors, (111), 56 states have call successors, (56), 15 states have call predecessors, (56), 14 states have return successors, (51), 49 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-14 15:19:52,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:19:52,704 INFO L93 Difference]: Finished difference Result 180 states and 239 transitions. [2022-04-14 15:19:52,704 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 239 transitions. [2022-04-14 15:19:52,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:19:52,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:19:52,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 93 states have (on average 1.1935483870967742) internal successors, (111), 99 states have internal predecessors, (111), 56 states have call successors, (56), 15 states have call predecessors, (56), 14 states have return successors, (51), 49 states have call predecessors, (51), 51 states have call successors, (51) Second operand 180 states. [2022-04-14 15:19:52,712 INFO L87 Difference]: Start difference. First operand has 164 states, 93 states have (on average 1.1935483870967742) internal successors, (111), 99 states have internal predecessors, (111), 56 states have call successors, (56), 15 states have call predecessors, (56), 14 states have return successors, (51), 49 states have call predecessors, (51), 51 states have call successors, (51) Second operand 180 states. [2022-04-14 15:19:52,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:19:52,715 INFO L93 Difference]: Finished difference Result 180 states and 239 transitions. [2022-04-14 15:19:52,715 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 239 transitions. [2022-04-14 15:19:52,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:19:52,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:19:52,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:19:52,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:19:52,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 93 states have (on average 1.1935483870967742) internal successors, (111), 99 states have internal predecessors, (111), 56 states have call successors, (56), 15 states have call predecessors, (56), 14 states have return successors, (51), 49 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-14 15:19:52,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 218 transitions. [2022-04-14 15:19:52,720 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 218 transitions. Word has length 34 [2022-04-14 15:19:52,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:19:52,720 INFO L478 AbstractCegarLoop]: Abstraction has 164 states and 218 transitions. [2022-04-14 15:19:52,720 INFO L479 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-14 15:19:52,720 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 218 transitions. [2022-04-14 15:19:52,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-14 15:19:52,720 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:19:52,720 INFO L499 BasicCegarLoop]: 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-14 15:19:52,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-14 15:19:52,926 WARN L460 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-14 15:19:52,926 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:19:52,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:19:52,927 INFO L85 PathProgramCache]: Analyzing trace with hash 821435566, now seen corresponding path program 1 times [2022-04-14 15:19:52,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:19:52,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40105345] [2022-04-14 15:19:52,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:19:52,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:19:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:19:53,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:19:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:19:53,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {5561#(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; {5551#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:53,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {5551#(<= ~counter~0 0)} assume true; {5551#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:53,039 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5551#(<= ~counter~0 0)} {5546#true} #102#return; {5551#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:53,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:19:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:19:53,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {5546#true} ~cond := #in~cond; {5546#true} is VALID [2022-04-14 15:19:53,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {5546#true} assume !(0 == ~cond); {5546#true} is VALID [2022-04-14 15:19:53,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {5546#true} assume true; {5546#true} is VALID [2022-04-14 15:19:53,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5546#true} {5551#(<= ~counter~0 0)} #82#return; {5551#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:53,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {5546#true} call ULTIMATE.init(); {5561#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:19:53,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {5561#(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; {5551#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:53,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {5551#(<= ~counter~0 0)} assume true; {5551#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:53,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5551#(<= ~counter~0 0)} {5546#true} #102#return; {5551#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:53,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {5551#(<= ~counter~0 0)} call #t~ret7 := main(); {5551#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:53,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {5551#(<= ~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; {5551#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:53,048 INFO L272 TraceCheckUtils]: 6: Hoare triple {5551#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5546#true} is VALID [2022-04-14 15:19:53,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {5546#true} ~cond := #in~cond; {5546#true} is VALID [2022-04-14 15:19:53,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {5546#true} assume !(0 == ~cond); {5546#true} is VALID [2022-04-14 15:19:53,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {5546#true} assume true; {5546#true} is VALID [2022-04-14 15:19:53,048 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5546#true} {5551#(<= ~counter~0 0)} #82#return; {5551#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:53,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {5551#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5551#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:53,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {5551#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5556#(<= ~counter~0 1)} is VALID [2022-04-14 15:19:53,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {5556#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {5556#(<= ~counter~0 1)} is VALID [2022-04-14 15:19:53,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {5556#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5556#(<= ~counter~0 1)} is VALID [2022-04-14 15:19:53,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {5556#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5557#(<= ~counter~0 2)} is VALID [2022-04-14 15:19:53,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {5557#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {5557#(<= ~counter~0 2)} is VALID [2022-04-14 15:19:53,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {5557#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5557#(<= ~counter~0 2)} is VALID [2022-04-14 15:19:53,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {5557#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5558#(<= ~counter~0 3)} is VALID [2022-04-14 15:19:53,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {5558#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {5558#(<= ~counter~0 3)} is VALID [2022-04-14 15:19:53,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {5558#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5558#(<= ~counter~0 3)} is VALID [2022-04-14 15:19:53,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {5558#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5559#(<= ~counter~0 4)} is VALID [2022-04-14 15:19:53,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {5559#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {5559#(<= ~counter~0 4)} is VALID [2022-04-14 15:19:53,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {5559#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5559#(<= ~counter~0 4)} is VALID [2022-04-14 15:19:53,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {5559#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5560#(<= |main_#t~post5| 4)} is VALID [2022-04-14 15:19:53,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {5560#(<= |main_#t~post5| 4)} assume !(#t~post5 < 100);havoc #t~post5; {5547#false} is VALID [2022-04-14 15:19:53,070 INFO L290 TraceCheckUtils]: 26: Hoare triple {5547#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5547#false} is VALID [2022-04-14 15:19:53,070 INFO L290 TraceCheckUtils]: 27: Hoare triple {5547#false} assume !!(#t~post6 < 100);havoc #t~post6; {5547#false} is VALID [2022-04-14 15:19:53,070 INFO L272 TraceCheckUtils]: 28: Hoare triple {5547#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5547#false} is VALID [2022-04-14 15:19:53,070 INFO L290 TraceCheckUtils]: 29: Hoare triple {5547#false} ~cond := #in~cond; {5547#false} is VALID [2022-04-14 15:19:53,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {5547#false} assume 0 == ~cond; {5547#false} is VALID [2022-04-14 15:19:53,070 INFO L290 TraceCheckUtils]: 31: Hoare triple {5547#false} assume !false; {5547#false} is VALID [2022-04-14 15:19:53,071 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-14 15:19:53,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:19:53,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40105345] [2022-04-14 15:19:53,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40105345] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:19:53,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751986398] [2022-04-14 15:19:53,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:19:53,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:19:53,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:19:53,072 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-14 15:19:53,073 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-14 15:19:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:19:53,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 15:19:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:19:53,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:19:53,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {5546#true} call ULTIMATE.init(); {5546#true} is VALID [2022-04-14 15:19:53,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {5546#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; {5551#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:53,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {5551#(<= ~counter~0 0)} assume true; {5551#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:53,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5551#(<= ~counter~0 0)} {5546#true} #102#return; {5551#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:53,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {5551#(<= ~counter~0 0)} call #t~ret7 := main(); {5551#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:53,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {5551#(<= ~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; {5551#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:53,320 INFO L272 TraceCheckUtils]: 6: Hoare triple {5551#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5551#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:53,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {5551#(<= ~counter~0 0)} ~cond := #in~cond; {5551#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:53,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {5551#(<= ~counter~0 0)} assume !(0 == ~cond); {5551#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:53,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {5551#(<= ~counter~0 0)} assume true; {5551#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:53,322 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5551#(<= ~counter~0 0)} {5551#(<= ~counter~0 0)} #82#return; {5551#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:53,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {5551#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5551#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:53,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {5551#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5556#(<= ~counter~0 1)} is VALID [2022-04-14 15:19:53,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {5556#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {5556#(<= ~counter~0 1)} is VALID [2022-04-14 15:19:53,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {5556#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5556#(<= ~counter~0 1)} is VALID [2022-04-14 15:19:53,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {5556#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5557#(<= ~counter~0 2)} is VALID [2022-04-14 15:19:53,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {5557#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {5557#(<= ~counter~0 2)} is VALID [2022-04-14 15:19:53,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {5557#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5557#(<= ~counter~0 2)} is VALID [2022-04-14 15:19:53,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {5557#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5558#(<= ~counter~0 3)} is VALID [2022-04-14 15:19:53,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {5558#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {5558#(<= ~counter~0 3)} is VALID [2022-04-14 15:19:53,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {5558#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5558#(<= ~counter~0 3)} is VALID [2022-04-14 15:19:53,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {5558#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5559#(<= ~counter~0 4)} is VALID [2022-04-14 15:19:53,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {5559#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {5559#(<= ~counter~0 4)} is VALID [2022-04-14 15:19:53,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {5559#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5559#(<= ~counter~0 4)} is VALID [2022-04-14 15:19:53,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {5559#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5560#(<= |main_#t~post5| 4)} is VALID [2022-04-14 15:19:53,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {5560#(<= |main_#t~post5| 4)} assume !(#t~post5 < 100);havoc #t~post5; {5547#false} is VALID [2022-04-14 15:19:53,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {5547#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5547#false} is VALID [2022-04-14 15:19:53,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {5547#false} assume !!(#t~post6 < 100);havoc #t~post6; {5547#false} is VALID [2022-04-14 15:19:53,327 INFO L272 TraceCheckUtils]: 28: Hoare triple {5547#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5547#false} is VALID [2022-04-14 15:19:53,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {5547#false} ~cond := #in~cond; {5547#false} is VALID [2022-04-14 15:19:53,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {5547#false} assume 0 == ~cond; {5547#false} is VALID [2022-04-14 15:19:53,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {5547#false} assume !false; {5547#false} is VALID [2022-04-14 15:19:53,327 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-14 15:19:53,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:19:53,543 INFO L290 TraceCheckUtils]: 31: Hoare triple {5547#false} assume !false; {5547#false} is VALID [2022-04-14 15:19:53,543 INFO L290 TraceCheckUtils]: 30: Hoare triple {5547#false} assume 0 == ~cond; {5547#false} is VALID [2022-04-14 15:19:53,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {5547#false} ~cond := #in~cond; {5547#false} is VALID [2022-04-14 15:19:53,543 INFO L272 TraceCheckUtils]: 28: Hoare triple {5547#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5547#false} is VALID [2022-04-14 15:19:53,543 INFO L290 TraceCheckUtils]: 27: Hoare triple {5547#false} assume !!(#t~post6 < 100);havoc #t~post6; {5547#false} is VALID [2022-04-14 15:19:53,543 INFO L290 TraceCheckUtils]: 26: Hoare triple {5547#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5547#false} is VALID [2022-04-14 15:19:53,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {5676#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {5547#false} is VALID [2022-04-14 15:19:53,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {5680#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5676#(< |main_#t~post5| 100)} is VALID [2022-04-14 15:19:53,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {5680#(< ~counter~0 100)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5680#(< ~counter~0 100)} is VALID [2022-04-14 15:19:53,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {5680#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {5680#(< ~counter~0 100)} is VALID [2022-04-14 15:19:53,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {5690#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5680#(< ~counter~0 100)} is VALID [2022-04-14 15:19:53,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {5690#(< ~counter~0 99)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5690#(< ~counter~0 99)} is VALID [2022-04-14 15:19:53,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {5690#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {5690#(< ~counter~0 99)} is VALID [2022-04-14 15:19:53,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {5700#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5690#(< ~counter~0 99)} is VALID [2022-04-14 15:19:53,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {5700#(< ~counter~0 98)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5700#(< ~counter~0 98)} is VALID [2022-04-14 15:19:53,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {5700#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {5700#(< ~counter~0 98)} is VALID [2022-04-14 15:19:53,551 INFO L290 TraceCheckUtils]: 15: Hoare triple {5710#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5700#(< ~counter~0 98)} is VALID [2022-04-14 15:19:53,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {5710#(< ~counter~0 97)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5710#(< ~counter~0 97)} is VALID [2022-04-14 15:19:53,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {5710#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {5710#(< ~counter~0 97)} is VALID [2022-04-14 15:19:53,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {5720#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5710#(< ~counter~0 97)} is VALID [2022-04-14 15:19:53,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {5720#(< ~counter~0 96)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5720#(< ~counter~0 96)} is VALID [2022-04-14 15:19:53,552 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5546#true} {5720#(< ~counter~0 96)} #82#return; {5720#(< ~counter~0 96)} is VALID [2022-04-14 15:19:53,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {5546#true} assume true; {5546#true} is VALID [2022-04-14 15:19:53,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {5546#true} assume !(0 == ~cond); {5546#true} is VALID [2022-04-14 15:19:53,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {5546#true} ~cond := #in~cond; {5546#true} is VALID [2022-04-14 15:19:53,552 INFO L272 TraceCheckUtils]: 6: Hoare triple {5720#(< ~counter~0 96)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5546#true} is VALID [2022-04-14 15:19:53,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {5720#(< ~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; {5720#(< ~counter~0 96)} is VALID [2022-04-14 15:19:53,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {5720#(< ~counter~0 96)} call #t~ret7 := main(); {5720#(< ~counter~0 96)} is VALID [2022-04-14 15:19:53,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5720#(< ~counter~0 96)} {5546#true} #102#return; {5720#(< ~counter~0 96)} is VALID [2022-04-14 15:19:53,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {5720#(< ~counter~0 96)} assume true; {5720#(< ~counter~0 96)} is VALID [2022-04-14 15:19:53,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {5546#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; {5720#(< ~counter~0 96)} is VALID [2022-04-14 15:19:53,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {5546#true} call ULTIMATE.init(); {5546#true} is VALID [2022-04-14 15:19:53,554 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-14 15:19:53,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751986398] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:19:53,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 15:19:53,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-14 15:19:53,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76530917] [2022-04-14 15:19:53,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 15:19:53,555 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-14 15:19:53,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:19:53,555 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-14 15:19:53,600 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-14 15:19:53,600 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-14 15:19:53,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:19:53,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-14 15:19:53,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-04-14 15:19:53,601 INFO L87 Difference]: Start difference. First operand 164 states and 218 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-14 15:19:59,131 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:20:03,327 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-14 15:20:05,335 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-14 15:20:07,341 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-14 15:20:09,348 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-14 15:20:12,506 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-14 15:20:14,509 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-14 15:20:16,429 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:20:18,446 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-14 15:20:20,450 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-14 15:20:22,731 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-14 15:20:25,307 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:20:28,433 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:20:30,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-14 15:20:32,891 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:20:34,997 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:20:38,162 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:20:45,881 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-14 15:20:49,156 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-14 15:20:52,561 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-14 15:20:54,590 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-14 15:20:56,648 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-14 15:20:58,658 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-14 15:21:00,761 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-14 15:21:02,766 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-14 15:21:06,311 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:21:06,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:21:06,999 INFO L93 Difference]: Finished difference Result 402 states and 534 transitions. [2022-04-14 15:21:06,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-14 15:21:06,999 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-14 15:21:06,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:21:06,999 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-14 15:21:07,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 246 transitions. [2022-04-14 15:21:07,004 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-14 15:21:07,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 246 transitions. [2022-04-14 15:21:07,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 246 transitions. [2022-04-14 15:21:07,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:21:07,244 INFO L225 Difference]: With dead ends: 402 [2022-04-14 15:21:07,244 INFO L226 Difference]: Without dead ends: 351 [2022-04-14 15:21:07,245 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=716, Unknown=0, NotChecked=0, Total=992 [2022-04-14 15:21:07,245 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 188 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 130 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 60.8s IncrementalHoareTripleChecker+Time [2022-04-14 15:21:07,245 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 148 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 348 Invalid, 23 Unknown, 0 Unchecked, 60.8s Time] [2022-04-14 15:21:07,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-04-14 15:21:07,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 344. [2022-04-14 15:21:07,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:21:07,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 351 states. Second operand has 344 states, 196 states have (on average 1.183673469387755) internal successors, (232), 211 states have internal predecessors, (232), 114 states have call successors, (114), 34 states have call predecessors, (114), 33 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2022-04-14 15:21:07,395 INFO L74 IsIncluded]: Start isIncluded. First operand 351 states. Second operand has 344 states, 196 states have (on average 1.183673469387755) internal successors, (232), 211 states have internal predecessors, (232), 114 states have call successors, (114), 34 states have call predecessors, (114), 33 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2022-04-14 15:21:07,395 INFO L87 Difference]: Start difference. First operand 351 states. Second operand has 344 states, 196 states have (on average 1.183673469387755) internal successors, (232), 211 states have internal predecessors, (232), 114 states have call successors, (114), 34 states have call predecessors, (114), 33 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2022-04-14 15:21:07,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:21:07,402 INFO L93 Difference]: Finished difference Result 351 states and 455 transitions. [2022-04-14 15:21:07,402 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 455 transitions. [2022-04-14 15:21:07,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:21:07,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:21:07,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 196 states have (on average 1.183673469387755) internal successors, (232), 211 states have internal predecessors, (232), 114 states have call successors, (114), 34 states have call predecessors, (114), 33 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) Second operand 351 states. [2022-04-14 15:21:07,404 INFO L87 Difference]: Start difference. First operand has 344 states, 196 states have (on average 1.183673469387755) internal successors, (232), 211 states have internal predecessors, (232), 114 states have call successors, (114), 34 states have call predecessors, (114), 33 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) Second operand 351 states. [2022-04-14 15:21:07,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:21:07,411 INFO L93 Difference]: Finished difference Result 351 states and 455 transitions. [2022-04-14 15:21:07,411 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 455 transitions. [2022-04-14 15:21:07,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:21:07,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:21:07,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:21:07,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:21:07,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 196 states have (on average 1.183673469387755) internal successors, (232), 211 states have internal predecessors, (232), 114 states have call successors, (114), 34 states have call predecessors, (114), 33 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2022-04-14 15:21:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 451 transitions. [2022-04-14 15:21:07,421 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 451 transitions. Word has length 32 [2022-04-14 15:21:07,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:21:07,421 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 451 transitions. [2022-04-14 15:21:07,421 INFO L479 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-14 15:21:07,421 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 451 transitions. [2022-04-14 15:21:07,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-14 15:21:07,422 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:21:07,422 INFO L499 BasicCegarLoop]: 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-14 15:21:07,439 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-14 15:21:07,637 WARN L460 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-14 15:21:07,638 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:21:07,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:21:07,638 INFO L85 PathProgramCache]: Analyzing trace with hash -271152338, now seen corresponding path program 2 times [2022-04-14 15:21:07,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:21:07,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835114574] [2022-04-14 15:21:07,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:21:07,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:21:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:21:07,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:21:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:21:07,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {7607#(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; {7591#(<= ~counter~0 0)} is VALID [2022-04-14 15:21:07,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {7591#(<= ~counter~0 0)} assume true; {7591#(<= ~counter~0 0)} is VALID [2022-04-14 15:21:07,793 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7591#(<= ~counter~0 0)} {7586#true} #102#return; {7591#(<= ~counter~0 0)} is VALID [2022-04-14 15:21:07,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:21:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:21:07,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {7586#true} ~cond := #in~cond; {7586#true} is VALID [2022-04-14 15:21:07,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {7586#true} assume !(0 == ~cond); {7586#true} is VALID [2022-04-14 15:21:07,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {7586#true} assume true; {7586#true} is VALID [2022-04-14 15:21:07,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7586#true} {7591#(<= ~counter~0 0)} #82#return; {7591#(<= ~counter~0 0)} is VALID [2022-04-14 15:21:07,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {7586#true} call ULTIMATE.init(); {7607#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:21:07,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {7607#(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; {7591#(<= ~counter~0 0)} is VALID [2022-04-14 15:21:07,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {7591#(<= ~counter~0 0)} assume true; {7591#(<= ~counter~0 0)} is VALID [2022-04-14 15:21:07,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7591#(<= ~counter~0 0)} {7586#true} #102#return; {7591#(<= ~counter~0 0)} is VALID [2022-04-14 15:21:07,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {7591#(<= ~counter~0 0)} call #t~ret7 := main(); {7591#(<= ~counter~0 0)} is VALID [2022-04-14 15:21:07,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {7591#(<= ~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; {7591#(<= ~counter~0 0)} is VALID [2022-04-14 15:21:07,800 INFO L272 TraceCheckUtils]: 6: Hoare triple {7591#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {7586#true} is VALID [2022-04-14 15:21:07,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {7586#true} ~cond := #in~cond; {7586#true} is VALID [2022-04-14 15:21:07,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {7586#true} assume !(0 == ~cond); {7586#true} is VALID [2022-04-14 15:21:07,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {7586#true} assume true; {7586#true} is VALID [2022-04-14 15:21:07,800 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7586#true} {7591#(<= ~counter~0 0)} #82#return; {7591#(<= ~counter~0 0)} is VALID [2022-04-14 15:21:07,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {7591#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {7591#(<= ~counter~0 0)} is VALID [2022-04-14 15:21:07,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {7591#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7596#(<= ~counter~0 1)} is VALID [2022-04-14 15:21:07,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {7596#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {7596#(<= ~counter~0 1)} is VALID [2022-04-14 15:21:07,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {7596#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7596#(<= ~counter~0 1)} is VALID [2022-04-14 15:21:07,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {7596#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7597#(<= ~counter~0 2)} is VALID [2022-04-14 15:21:07,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {7597#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {7597#(<= ~counter~0 2)} is VALID [2022-04-14 15:21:07,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {7597#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7597#(<= ~counter~0 2)} is VALID [2022-04-14 15:21:07,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {7597#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7598#(<= ~counter~0 3)} is VALID [2022-04-14 15:21:07,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {7598#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {7598#(<= ~counter~0 3)} is VALID [2022-04-14 15:21:07,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {7598#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7598#(<= ~counter~0 3)} is VALID [2022-04-14 15:21:07,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {7598#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7599#(<= ~counter~0 4)} is VALID [2022-04-14 15:21:07,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {7599#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {7599#(<= ~counter~0 4)} is VALID [2022-04-14 15:21:07,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {7599#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7599#(<= ~counter~0 4)} is VALID [2022-04-14 15:21:07,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {7599#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7600#(<= ~counter~0 5)} is VALID [2022-04-14 15:21:07,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {7600#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {7600#(<= ~counter~0 5)} is VALID [2022-04-14 15:21:07,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {7600#(<= ~counter~0 5)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7600#(<= ~counter~0 5)} is VALID [2022-04-14 15:21:07,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {7600#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7601#(<= ~counter~0 6)} is VALID [2022-04-14 15:21:07,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {7601#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {7601#(<= ~counter~0 6)} is VALID [2022-04-14 15:21:07,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {7601#(<= ~counter~0 6)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7601#(<= ~counter~0 6)} is VALID [2022-04-14 15:21:07,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {7601#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7602#(<= ~counter~0 7)} is VALID [2022-04-14 15:21:07,808 INFO L290 TraceCheckUtils]: 31: Hoare triple {7602#(<= ~counter~0 7)} assume !!(#t~post5 < 100);havoc #t~post5; {7602#(<= ~counter~0 7)} is VALID [2022-04-14 15:21:07,808 INFO L290 TraceCheckUtils]: 32: Hoare triple {7602#(<= ~counter~0 7)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7602#(<= ~counter~0 7)} is VALID [2022-04-14 15:21:07,808 INFO L290 TraceCheckUtils]: 33: Hoare triple {7602#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7603#(<= ~counter~0 8)} is VALID [2022-04-14 15:21:07,809 INFO L290 TraceCheckUtils]: 34: Hoare triple {7603#(<= ~counter~0 8)} assume !!(#t~post5 < 100);havoc #t~post5; {7603#(<= ~counter~0 8)} is VALID [2022-04-14 15:21:07,809 INFO L290 TraceCheckUtils]: 35: Hoare triple {7603#(<= ~counter~0 8)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7603#(<= ~counter~0 8)} is VALID [2022-04-14 15:21:07,809 INFO L290 TraceCheckUtils]: 36: Hoare triple {7603#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7604#(<= ~counter~0 9)} is VALID [2022-04-14 15:21:07,810 INFO L290 TraceCheckUtils]: 37: Hoare triple {7604#(<= ~counter~0 9)} assume !!(#t~post5 < 100);havoc #t~post5; {7604#(<= ~counter~0 9)} is VALID [2022-04-14 15:21:07,810 INFO L290 TraceCheckUtils]: 38: Hoare triple {7604#(<= ~counter~0 9)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7604#(<= ~counter~0 9)} is VALID [2022-04-14 15:21:07,811 INFO L290 TraceCheckUtils]: 39: Hoare triple {7604#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7605#(<= ~counter~0 10)} is VALID [2022-04-14 15:21:07,811 INFO L290 TraceCheckUtils]: 40: Hoare triple {7605#(<= ~counter~0 10)} assume !!(#t~post5 < 100);havoc #t~post5; {7605#(<= ~counter~0 10)} is VALID [2022-04-14 15:21:07,811 INFO L290 TraceCheckUtils]: 41: Hoare triple {7605#(<= ~counter~0 10)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7605#(<= ~counter~0 10)} is VALID [2022-04-14 15:21:07,811 INFO L290 TraceCheckUtils]: 42: Hoare triple {7605#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7606#(<= |main_#t~post5| 10)} is VALID [2022-04-14 15:21:07,812 INFO L290 TraceCheckUtils]: 43: Hoare triple {7606#(<= |main_#t~post5| 10)} assume !(#t~post5 < 100);havoc #t~post5; {7587#false} is VALID [2022-04-14 15:21:07,812 INFO L290 TraceCheckUtils]: 44: Hoare triple {7587#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7587#false} is VALID [2022-04-14 15:21:07,812 INFO L290 TraceCheckUtils]: 45: Hoare triple {7587#false} assume !!(#t~post6 < 100);havoc #t~post6; {7587#false} is VALID [2022-04-14 15:21:07,812 INFO L272 TraceCheckUtils]: 46: Hoare triple {7587#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {7587#false} is VALID [2022-04-14 15:21:07,812 INFO L290 TraceCheckUtils]: 47: Hoare triple {7587#false} ~cond := #in~cond; {7587#false} is VALID [2022-04-14 15:21:07,812 INFO L290 TraceCheckUtils]: 48: Hoare triple {7587#false} assume 0 == ~cond; {7587#false} is VALID [2022-04-14 15:21:07,812 INFO L290 TraceCheckUtils]: 49: Hoare triple {7587#false} assume !false; {7587#false} is VALID [2022-04-14 15:21:07,812 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-14 15:21:07,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:21:07,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835114574] [2022-04-14 15:21:07,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835114574] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:21:07,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002189388] [2022-04-14 15:21:07,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 15:21:07,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:21:07,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:21:07,814 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-14 15:21:07,814 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-14 15:21:07,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-14 15:21:07,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:21:07,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-14 15:21:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:21:07,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:21:07,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {7586#true} call ULTIMATE.init(); {7586#true} is VALID [2022-04-14 15:21:07,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {7586#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; {7586#true} is VALID [2022-04-14 15:21:07,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {7586#true} assume true; {7586#true} is VALID [2022-04-14 15:21:07,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7586#true} {7586#true} #102#return; {7586#true} is VALID [2022-04-14 15:21:07,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {7586#true} call #t~ret7 := main(); {7586#true} is VALID [2022-04-14 15:21:07,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {7586#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {7586#true} is VALID [2022-04-14 15:21:07,987 INFO L272 TraceCheckUtils]: 6: Hoare triple {7586#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {7586#true} is VALID [2022-04-14 15:21:07,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {7586#true} ~cond := #in~cond; {7586#true} is VALID [2022-04-14 15:21:07,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {7586#true} assume !(0 == ~cond); {7586#true} is VALID [2022-04-14 15:21:07,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {7586#true} assume true; {7586#true} is VALID [2022-04-14 15:21:07,987 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7586#true} {7586#true} #82#return; {7586#true} is VALID [2022-04-14 15:21:07,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {7586#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {7586#true} is VALID [2022-04-14 15:21:07,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {7586#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7586#true} is VALID [2022-04-14 15:21:07,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {7586#true} assume !!(#t~post5 < 100);havoc #t~post5; {7586#true} is VALID [2022-04-14 15:21:07,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {7586#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7586#true} is VALID [2022-04-14 15:21:07,987 INFO L290 TraceCheckUtils]: 15: Hoare triple {7586#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7586#true} is VALID [2022-04-14 15:21:07,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {7586#true} assume !!(#t~post5 < 100);havoc #t~post5; {7586#true} is VALID [2022-04-14 15:21:07,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {7586#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7586#true} is VALID [2022-04-14 15:21:07,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {7586#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7586#true} is VALID [2022-04-14 15:21:07,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {7586#true} assume !!(#t~post5 < 100);havoc #t~post5; {7586#true} is VALID [2022-04-14 15:21:07,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {7586#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7586#true} is VALID [2022-04-14 15:21:07,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {7586#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7586#true} is VALID [2022-04-14 15:21:07,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {7586#true} assume !!(#t~post5 < 100);havoc #t~post5; {7586#true} is VALID [2022-04-14 15:21:07,987 INFO L290 TraceCheckUtils]: 23: Hoare triple {7586#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7586#true} is VALID [2022-04-14 15:21:07,987 INFO L290 TraceCheckUtils]: 24: Hoare triple {7586#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7586#true} is VALID [2022-04-14 15:21:07,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {7586#true} assume !!(#t~post5 < 100);havoc #t~post5; {7586#true} is VALID [2022-04-14 15:21:07,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {7586#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7586#true} is VALID [2022-04-14 15:21:07,988 INFO L290 TraceCheckUtils]: 27: Hoare triple {7586#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7586#true} is VALID [2022-04-14 15:21:07,988 INFO L290 TraceCheckUtils]: 28: Hoare triple {7586#true} assume !!(#t~post5 < 100);havoc #t~post5; {7586#true} is VALID [2022-04-14 15:21:07,988 INFO L290 TraceCheckUtils]: 29: Hoare triple {7586#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7586#true} is VALID [2022-04-14 15:21:07,988 INFO L290 TraceCheckUtils]: 30: Hoare triple {7586#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7586#true} is VALID [2022-04-14 15:21:07,988 INFO L290 TraceCheckUtils]: 31: Hoare triple {7586#true} assume !!(#t~post5 < 100);havoc #t~post5; {7586#true} is VALID [2022-04-14 15:21:07,988 INFO L290 TraceCheckUtils]: 32: Hoare triple {7586#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7586#true} is VALID [2022-04-14 15:21:07,988 INFO L290 TraceCheckUtils]: 33: Hoare triple {7586#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7586#true} is VALID [2022-04-14 15:21:07,988 INFO L290 TraceCheckUtils]: 34: Hoare triple {7586#true} assume !!(#t~post5 < 100);havoc #t~post5; {7586#true} is VALID [2022-04-14 15:21:07,988 INFO L290 TraceCheckUtils]: 35: Hoare triple {7586#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7586#true} is VALID [2022-04-14 15:21:07,988 INFO L290 TraceCheckUtils]: 36: Hoare triple {7586#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7586#true} is VALID [2022-04-14 15:21:07,988 INFO L290 TraceCheckUtils]: 37: Hoare triple {7586#true} assume !!(#t~post5 < 100);havoc #t~post5; {7586#true} is VALID [2022-04-14 15:21:07,988 INFO L290 TraceCheckUtils]: 38: Hoare triple {7586#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7586#true} is VALID [2022-04-14 15:21:07,988 INFO L290 TraceCheckUtils]: 39: Hoare triple {7586#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7586#true} is VALID [2022-04-14 15:21:07,988 INFO L290 TraceCheckUtils]: 40: Hoare triple {7586#true} assume !!(#t~post5 < 100);havoc #t~post5; {7586#true} is VALID [2022-04-14 15:21:07,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {7586#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7586#true} is VALID [2022-04-14 15:21:07,989 INFO L290 TraceCheckUtils]: 42: Hoare triple {7586#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7737#(<= (+ |main_#t~post5| 1) ~counter~0)} is VALID [2022-04-14 15:21:07,990 INFO L290 TraceCheckUtils]: 43: Hoare triple {7737#(<= (+ |main_#t~post5| 1) ~counter~0)} assume !(#t~post5 < 100);havoc #t~post5; {7741#(<= 101 ~counter~0)} is VALID [2022-04-14 15:21:07,990 INFO L290 TraceCheckUtils]: 44: Hoare triple {7741#(<= 101 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7745#(<= 101 |main_#t~post6|)} is VALID [2022-04-14 15:21:07,991 INFO L290 TraceCheckUtils]: 45: Hoare triple {7745#(<= 101 |main_#t~post6|)} assume !!(#t~post6 < 100);havoc #t~post6; {7587#false} is VALID [2022-04-14 15:21:07,991 INFO L272 TraceCheckUtils]: 46: Hoare triple {7587#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {7587#false} is VALID [2022-04-14 15:21:07,991 INFO L290 TraceCheckUtils]: 47: Hoare triple {7587#false} ~cond := #in~cond; {7587#false} is VALID [2022-04-14 15:21:07,991 INFO L290 TraceCheckUtils]: 48: Hoare triple {7587#false} assume 0 == ~cond; {7587#false} is VALID [2022-04-14 15:21:07,991 INFO L290 TraceCheckUtils]: 49: Hoare triple {7587#false} assume !false; {7587#false} is VALID [2022-04-14 15:21:07,991 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-14 15:21:07,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:21:07,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002189388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:21:07,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:21:07,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2022-04-14 15:21:07,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891220959] [2022-04-14 15:21:07,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:21:07,992 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-14 15:21:07,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:21:07,992 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-14 15:21:08,006 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-14 15:21:08,006 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:21:08,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:21:08,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:21:08,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-04-14 15:21:08,007 INFO L87 Difference]: Start difference. First operand 344 states and 451 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-14 15:21:11,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:21:11,702 INFO L93 Difference]: Finished difference Result 392 states and 520 transitions. [2022-04-14 15:21:11,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:21:11,702 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-14 15:21:11,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:21:11,703 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-14 15:21:11,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-14 15:21:11,704 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-14 15:21:11,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-14 15:21:11,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-14 15:21:11,767 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-14 15:21:11,773 INFO L225 Difference]: With dead ends: 392 [2022-04-14 15:21:11,773 INFO L226 Difference]: Without dead ends: 341 [2022-04-14 15:21:11,774 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-04-14 15:21:11,774 INFO L913 BasicCegarLoop]: 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-14 15:21:11,774 INFO L914 BasicCegarLoop]: 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-14 15:21:11,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-04-14 15:21:11,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 336. [2022-04-14 15:21:11,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:21:11,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 341 states. Second operand has 336 states, 189 states have (on average 1.17989417989418) internal successors, (223), 203 states have internal predecessors, (223), 113 states have call successors, (113), 34 states have call predecessors, (113), 33 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2022-04-14 15:21:11,940 INFO L74 IsIncluded]: Start isIncluded. First operand 341 states. Second operand has 336 states, 189 states have (on average 1.17989417989418) internal successors, (223), 203 states have internal predecessors, (223), 113 states have call successors, (113), 34 states have call predecessors, (113), 33 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2022-04-14 15:21:11,940 INFO L87 Difference]: Start difference. First operand 341 states. Second operand has 336 states, 189 states have (on average 1.17989417989418) internal successors, (223), 203 states have internal predecessors, (223), 113 states have call successors, (113), 34 states have call predecessors, (113), 33 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2022-04-14 15:21:11,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:21:11,947 INFO L93 Difference]: Finished difference Result 341 states and 446 transitions. [2022-04-14 15:21:11,947 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 446 transitions. [2022-04-14 15:21:11,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:21:11,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:21:11,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 336 states, 189 states have (on average 1.17989417989418) internal successors, (223), 203 states have internal predecessors, (223), 113 states have call successors, (113), 34 states have call predecessors, (113), 33 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) Second operand 341 states. [2022-04-14 15:21:11,949 INFO L87 Difference]: Start difference. First operand has 336 states, 189 states have (on average 1.17989417989418) internal successors, (223), 203 states have internal predecessors, (223), 113 states have call successors, (113), 34 states have call predecessors, (113), 33 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) Second operand 341 states. [2022-04-14 15:21:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:21:11,955 INFO L93 Difference]: Finished difference Result 341 states and 446 transitions. [2022-04-14 15:21:11,955 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 446 transitions. [2022-04-14 15:21:11,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:21:11,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:21:11,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:21:11,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:21:11,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 189 states have (on average 1.17989417989418) internal successors, (223), 203 states have internal predecessors, (223), 113 states have call successors, (113), 34 states have call predecessors, (113), 33 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2022-04-14 15:21:11,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 440 transitions. [2022-04-14 15:21:11,964 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 440 transitions. Word has length 50 [2022-04-14 15:21:11,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:21:11,964 INFO L478 AbstractCegarLoop]: Abstraction has 336 states and 440 transitions. [2022-04-14 15:21:11,964 INFO L479 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-14 15:21:11,965 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 440 transitions. [2022-04-14 15:21:11,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-14 15:21:11,965 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:21:11,965 INFO L499 BasicCegarLoop]: 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-14 15:21:11,982 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-14 15:21:12,182 WARN L460 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-14 15:21:12,182 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:21:12,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:21:12,182 INFO L85 PathProgramCache]: Analyzing trace with hash 109392637, now seen corresponding path program 1 times [2022-04-14 15:21:12,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:21:12,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94254234] [2022-04-14 15:21:12,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:21:12,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:21:12,194 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:21:12,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [616465001] [2022-04-14 15:21:12,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:21:12,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:21:12,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:21:12,196 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-14 15:21:12,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process