/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_12.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 01:07:32,088 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 01:07:32,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 01:07:32,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 01:07:32,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 01:07:32,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 01:07:32,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 01:07:32,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 01:07:32,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 01:07:32,157 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 01:07:32,157 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 01:07:32,158 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 01:07:32,158 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 01:07:32,159 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 01:07:32,160 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 01:07:32,161 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 01:07:32,161 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 01:07:32,162 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 01:07:32,163 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 01:07:32,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 01:07:32,166 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 01:07:32,171 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 01:07:32,173 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 01:07:32,175 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 01:07:32,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 01:07:32,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 01:07:32,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 01:07:32,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 01:07:32,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 01:07:32,186 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 01:07:32,187 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 01:07:32,187 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 01:07:32,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 01:07:32,188 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 01:07:32,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 01:07:32,189 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 01:07:32,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 01:07:32,190 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 01:07:32,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 01:07:32,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 01:07:32,196 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 01:07:32,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 01:07:32,198 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 01:07:32,224 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 01:07:32,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 01:07:32,225 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 01:07:32,226 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 01:07:32,226 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 01:07:32,227 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 01:07:32,227 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 01:07:32,227 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 01:07:32,227 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 01:07:32,228 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 01:07:32,228 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 01:07:32,228 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 01:07:32,228 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 01:07:32,228 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 01:07:32,229 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 01:07:32,229 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 01:07:32,229 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 01:07:32,229 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 01:07:32,229 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 01:07:32,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 01:07:32,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 01:07:32,230 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 01:07:32,230 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 01:07:32,230 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 01:07:32,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 01:07:32,230 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 01:07:32,231 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 01:07:32,231 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 01:07:32,231 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 01:07:32,232 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-15 01:07:32,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 01:07:32,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 01:07:32,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 01:07:32,468 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 01:07:32,469 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 01:07:32,470 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_12.c [2022-04-15 01:07:32,514 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c20ca30e/c423a32e01674592baf3ba56615bd887/FLAG9120af911 [2022-04-15 01:07:32,825 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 01:07:32,825 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_12.c [2022-04-15 01:07:32,829 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c20ca30e/c423a32e01674592baf3ba56615bd887/FLAG9120af911 [2022-04-15 01:07:33,261 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c20ca30e/c423a32e01674592baf3ba56615bd887 [2022-04-15 01:07:33,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 01:07:33,264 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 01:07:33,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 01:07:33,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 01:07:33,272 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 01:07:33,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:07:33" (1/1) ... [2022-04-15 01:07:33,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11b75fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:07:33, skipping insertion in model container [2022-04-15 01:07:33,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:07:33" (1/1) ... [2022-04-15 01:07:33,279 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 01:07:33,296 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 01:07:33,409 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_12.c[319,332] [2022-04-15 01:07:33,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 01:07:33,441 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 01:07:33,456 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_12.c[319,332] [2022-04-15 01:07:33,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 01:07:33,488 INFO L208 MainTranslator]: Completed translation [2022-04-15 01:07:33,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:07:33 WrapperNode [2022-04-15 01:07:33,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 01:07:33,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 01:07:33,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 01:07:33,493 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 01:07:33,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:07:33" (1/1) ... [2022-04-15 01:07:33,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:07:33" (1/1) ... [2022-04-15 01:07:33,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:07:33" (1/1) ... [2022-04-15 01:07:33,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:07:33" (1/1) ... [2022-04-15 01:07:33,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:07:33" (1/1) ... [2022-04-15 01:07:33,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:07:33" (1/1) ... [2022-04-15 01:07:33,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:07:33" (1/1) ... [2022-04-15 01:07:33,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 01:07:33,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 01:07:33,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 01:07:33,528 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 01:07:33,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:07:33" (1/1) ... [2022-04-15 01:07:33,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 01:07:33,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:07:33,557 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-15 01:07:33,559 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-15 01:07:33,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 01:07:33,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 01:07:33,586 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 01:07:33,586 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 01:07:33,587 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 01:07:33,587 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 01:07:33,587 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 01:07:33,588 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 01:07:33,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 01:07:33,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 01:07:33,589 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 01:07:33,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 01:07:33,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 01:07:33,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 01:07:33,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 01:07:33,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 01:07:33,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 01:07:33,648 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 01:07:33,649 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 01:07:33,734 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 01:07:33,740 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 01:07:33,740 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 01:07:33,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:07:33 BoogieIcfgContainer [2022-04-15 01:07:33,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 01:07:33,742 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 01:07:33,742 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 01:07:33,743 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 01:07:33,747 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:07:33" (1/1) ... [2022-04-15 01:07:33,748 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 01:07:33,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 01:07:33 BasicIcfg [2022-04-15 01:07:33,763 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 01:07:33,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 01:07:33,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 01:07:33,767 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 01:07:33,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:07:33" (1/4) ... [2022-04-15 01:07:33,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a536dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:07:33, skipping insertion in model container [2022-04-15 01:07:33,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:07:33" (2/4) ... [2022-04-15 01:07:33,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a536dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:07:33, skipping insertion in model container [2022-04-15 01:07:33,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:07:33" (3/4) ... [2022-04-15 01:07:33,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a536dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:07:33, skipping insertion in model container [2022-04-15 01:07:33,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 01:07:33" (4/4) ... [2022-04-15 01:07:33,769 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_12.cqvasr [2022-04-15 01:07:33,773 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 01:07:33,774 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 01:07:33,806 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 01:07:33,811 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=FINITE_AUTOMATA, 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-15 01:07:33,811 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 01:07:33,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 01:07:33,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 01:07:33,830 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:07:33,830 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:07:33,830 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:07:33,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:07:33,834 INFO L85 PathProgramCache]: Analyzing trace with hash 447419557, now seen corresponding path program 1 times [2022-04-15 01:07:33,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:07:33,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902937517] [2022-04-15 01:07:33,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:07:33,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:07:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:07:34,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:07:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:07:34,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24#true} is VALID [2022-04-15 01:07:34,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 01:07:34,046 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 01:07:34,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:07:34,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24#true} is VALID [2022-04-15 01:07:34,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 01:07:34,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 01:07:34,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 01:07:34,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [51] mainENTRY-->L10-2: Formula: (and (= v_main_~y~0_2 10000000) (= v_main_~z~0_3 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {24#true} is VALID [2022-04-15 01:07:34,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [53] L10-2-->L10-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-15 01:07:34,050 INFO L272 TraceCheckUtils]: 7: Hoare triple {25#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 2)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0] {25#false} is VALID [2022-04-15 01:07:34,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {25#false} is VALID [2022-04-15 01:07:34,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-15 01:07:34,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-15 01:07:34,051 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-15 01:07:34,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:07:34,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902937517] [2022-04-15 01:07:34,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902937517] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:07:34,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:07:34,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 01:07:34,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383818511] [2022-04-15 01:07:34,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:07:34,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 01:07:34,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:07:34,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:34,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:07:34,106 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 01:07:34,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:07:34,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 01:07:34,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 01:07:34,125 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:34,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:07:34,190 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-15 01:07:34,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 01:07:34,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 01:07:34,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:07:34,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:34,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-15 01:07:34,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-15 01:07:34,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-15 01:07:34,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:07:34,279 INFO L225 Difference]: With dead ends: 33 [2022-04-15 01:07:34,279 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 01:07:34,281 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 01:07:34,284 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:07:34,285 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:07:34,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 01:07:34,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 01:07:34,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:07:34,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:34,323 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:34,324 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:34,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:07:34,330 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 01:07:34,330 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 01:07:34,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:07:34,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:07:34,331 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 01:07:34,332 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 01:07:34,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:07:34,336 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 01:07:34,336 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 01:07:34,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:07:34,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:07:34,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:07:34,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:07:34,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:34,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-15 01:07:34,341 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-15 01:07:34,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:07:34,342 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-15 01:07:34,343 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:34,343 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 01:07:34,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 01:07:34,344 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:07:34,344 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:07:34,344 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 01:07:34,344 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:07:34,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:07:34,345 INFO L85 PathProgramCache]: Analyzing trace with hash 448343078, now seen corresponding path program 1 times [2022-04-15 01:07:34,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:07:34,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395456273] [2022-04-15 01:07:34,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:07:34,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:07:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:07:34,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:07:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:07:34,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {123#true} is VALID [2022-04-15 01:07:34,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-15 01:07:34,467 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {123#true} {123#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-15 01:07:34,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {123#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:07:34,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {123#true} is VALID [2022-04-15 01:07:34,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {123#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-15 01:07:34,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123#true} {123#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-15 01:07:34,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {123#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-15 01:07:34,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {123#true} [51] mainENTRY-->L10-2: Formula: (and (= v_main_~y~0_2 10000000) (= v_main_~z~0_3 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {128#(= main_~z~0 0)} is VALID [2022-04-15 01:07:34,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {128#(= main_~z~0 0)} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {128#(= main_~z~0 0)} is VALID [2022-04-15 01:07:34,471 INFO L272 TraceCheckUtils]: 7: Hoare triple {128#(= main_~z~0 0)} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 2)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0] {129#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 01:07:34,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {129#(not (= |__VERIFIER_assert_#in~cond| 0))} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {130#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 01:07:34,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {130#(not (= __VERIFIER_assert_~cond 0))} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {124#false} is VALID [2022-04-15 01:07:34,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {124#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#false} is VALID [2022-04-15 01:07:34,473 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-15 01:07:34,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:07:34,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395456273] [2022-04-15 01:07:34,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395456273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:07:34,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:07:34,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 01:07:34,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716659122] [2022-04-15 01:07:34,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:07:34,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 01:07:34,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:07:34,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:34,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:07:34,489 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 01:07:34,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:07:34,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 01:07:34,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 01:07:34,492 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:34,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:07:34,651 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 01:07:34,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 01:07:34,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 01:07:34,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:07:34,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:34,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-15 01:07:34,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:34,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-15 01:07:34,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-04-15 01:07:34,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:07:34,687 INFO L225 Difference]: With dead ends: 22 [2022-04-15 01:07:34,687 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 01:07:34,691 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 01:07:34,698 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:07:34,699 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 31 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:07:34,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 01:07:34,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 01:07:34,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:07:34,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:34,706 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:34,706 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:34,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:07:34,708 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 01:07:34,708 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 01:07:34,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:07:34,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:07:34,710 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 01:07:34,711 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 01:07:34,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:07:34,713 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 01:07:34,713 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 01:07:34,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:07:34,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:07:34,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:07:34,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:07:34,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:34,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 01:07:34,715 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-15 01:07:34,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:07:34,716 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 01:07:34,716 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:34,716 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 01:07:34,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 01:07:34,717 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:07:34,717 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:07:34,717 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 01:07:34,718 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:07:34,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:07:34,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1890769175, now seen corresponding path program 1 times [2022-04-15 01:07:34,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:07:34,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552469063] [2022-04-15 01:07:34,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:07:34,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:07:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:07:34,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:07:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:07:34,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {231#true} is VALID [2022-04-15 01:07:34,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-15 01:07:34,858 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {231#true} {231#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-15 01:07:34,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:07:34,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {231#true} is VALID [2022-04-15 01:07:34,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-15 01:07:34,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-15 01:07:34,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-15 01:07:34,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#true} [51] mainENTRY-->L10-2: Formula: (and (= v_main_~y~0_2 10000000) (= v_main_~z~0_3 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {236#(= main_~x~0 0)} is VALID [2022-04-15 01:07:34,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {236#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {236#(= main_~x~0 0)} is VALID [2022-04-15 01:07:34,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {236#(= main_~x~0 0)} [57] L11-->L11-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_2 2) v_main_~z~0_1)) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0] {232#false} is VALID [2022-04-15 01:07:34,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {232#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {232#false} is VALID [2022-04-15 01:07:34,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {232#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {232#false} is VALID [2022-04-15 01:07:34,863 INFO L272 TraceCheckUtils]: 10: Hoare triple {232#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 2)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0] {232#false} is VALID [2022-04-15 01:07:34,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {232#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {232#false} is VALID [2022-04-15 01:07:34,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {232#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {232#false} is VALID [2022-04-15 01:07:34,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {232#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#false} is VALID [2022-04-15 01:07:34,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:07:34,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:07:34,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552469063] [2022-04-15 01:07:34,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552469063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:07:34,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:07:34,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 01:07:34,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132232366] [2022-04-15 01:07:34,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:07:34,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 01:07:34,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:07:34,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:34,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:07:34,884 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 01:07:34,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:07:34,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 01:07:34,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 01:07:34,885 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:34,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:07:34,939 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-15 01:07:34,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 01:07:34,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 01:07:34,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:07:34,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:34,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-15 01:07:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:34,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-15 01:07:34,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-15 01:07:34,972 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-15 01:07:34,973 INFO L225 Difference]: With dead ends: 28 [2022-04-15 01:07:34,973 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 01:07:34,976 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 01:07:34,981 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:07:34,982 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 19 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:07:34,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 01:07:34,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-15 01:07:34,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:07:34,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:34,989 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:34,990 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:34,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:07:34,992 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-15 01:07:34,992 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 01:07:34,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:07:34,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:07:34,993 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 01:07:34,993 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 01:07:34,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:07:34,995 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-15 01:07:34,995 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 01:07:34,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:07:34,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:07:34,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:07:34,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:07:35,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:35,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-15 01:07:35,003 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2022-04-15 01:07:35,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:07:35,004 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-15 01:07:35,004 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:35,004 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 01:07:35,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 01:07:35,005 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:07:35,005 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:07:35,005 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 01:07:35,005 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:07:35,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:07:35,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1862314917, now seen corresponding path program 1 times [2022-04-15 01:07:35,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:07:35,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498773629] [2022-04-15 01:07:35,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:07:35,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:07:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:07:35,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:07:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:07:35,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {357#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {350#true} is VALID [2022-04-15 01:07:35,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {350#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {350#true} is VALID [2022-04-15 01:07:35,155 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {350#true} {350#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {350#true} is VALID [2022-04-15 01:07:35,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {350#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {357#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:07:35,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {357#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {350#true} is VALID [2022-04-15 01:07:35,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {350#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {350#true} is VALID [2022-04-15 01:07:35,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {350#true} {350#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {350#true} is VALID [2022-04-15 01:07:35,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {350#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {350#true} is VALID [2022-04-15 01:07:35,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {350#true} [51] mainENTRY-->L10-2: Formula: (and (= v_main_~y~0_2 10000000) (= v_main_~z~0_3 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {355#(= main_~x~0 0)} is VALID [2022-04-15 01:07:35,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {355#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {355#(= main_~x~0 0)} is VALID [2022-04-15 01:07:35,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {355#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {355#(= main_~x~0 0)} is VALID [2022-04-15 01:07:35,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {355#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {356#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:07:35,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {356#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {356#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 01:07:35,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {356#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [57] L11-->L11-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_2 2) v_main_~z~0_1)) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0] {351#false} is VALID [2022-04-15 01:07:35,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {351#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {351#false} is VALID [2022-04-15 01:07:35,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {351#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {351#false} is VALID [2022-04-15 01:07:35,160 INFO L272 TraceCheckUtils]: 13: Hoare triple {351#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 2)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0] {351#false} is VALID [2022-04-15 01:07:35,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {351#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {351#false} is VALID [2022-04-15 01:07:35,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {351#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {351#false} is VALID [2022-04-15 01:07:35,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {351#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {351#false} is VALID [2022-04-15 01:07:35,161 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:07:35,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:07:35,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498773629] [2022-04-15 01:07:35,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498773629] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:07:35,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247704206] [2022-04-15 01:07:35,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:07:35,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:07:35,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:07:35,163 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-15 01:07:35,197 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-15 01:07:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:07:35,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 01:07:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:07:35,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:07:35,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {350#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {350#true} is VALID [2022-04-15 01:07:35,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {350#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {350#true} is VALID [2022-04-15 01:07:35,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {350#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {350#true} is VALID [2022-04-15 01:07:35,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {350#true} {350#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {350#true} is VALID [2022-04-15 01:07:35,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {350#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {350#true} is VALID [2022-04-15 01:07:35,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {350#true} [51] mainENTRY-->L10-2: Formula: (and (= v_main_~y~0_2 10000000) (= v_main_~z~0_3 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {376#(= main_~z~0 0)} is VALID [2022-04-15 01:07:35,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {376#(= main_~z~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {376#(= main_~z~0 0)} is VALID [2022-04-15 01:07:35,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {376#(= main_~z~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {376#(= main_~z~0 0)} is VALID [2022-04-15 01:07:35,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {376#(= main_~z~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {376#(= main_~z~0 0)} is VALID [2022-04-15 01:07:35,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {376#(= main_~z~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {376#(= main_~z~0 0)} is VALID [2022-04-15 01:07:35,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {376#(= main_~z~0 0)} [57] L11-->L11-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_2 2) v_main_~z~0_1)) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0] {392#(= main_~z~0 2)} is VALID [2022-04-15 01:07:35,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {392#(= main_~z~0 2)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {392#(= main_~z~0 2)} is VALID [2022-04-15 01:07:35,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {392#(= main_~z~0 2)} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {392#(= main_~z~0 2)} is VALID [2022-04-15 01:07:35,351 INFO L272 TraceCheckUtils]: 13: Hoare triple {392#(= main_~z~0 2)} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 2)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0] {402#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:07:35,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {402#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {406#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:07:35,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {406#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {351#false} is VALID [2022-04-15 01:07:35,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {351#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {351#false} is VALID [2022-04-15 01:07:35,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 01:07:35,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:07:35,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {351#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {351#false} is VALID [2022-04-15 01:07:35,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {406#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {351#false} is VALID [2022-04-15 01:07:35,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {402#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {406#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:07:35,517 INFO L272 TraceCheckUtils]: 13: Hoare triple {422#(= (mod main_~z~0 2) 0)} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 2)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0] {402#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:07:35,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {422#(= (mod main_~z~0 2) 0)} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {422#(= (mod main_~z~0 2) 0)} is VALID [2022-04-15 01:07:35,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {422#(= (mod main_~z~0 2) 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {422#(= (mod main_~z~0 2) 0)} is VALID [2022-04-15 01:07:35,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {422#(= (mod main_~z~0 2) 0)} [57] L11-->L11-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_2 2) v_main_~z~0_1)) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0] {422#(= (mod main_~z~0 2) 0)} is VALID [2022-04-15 01:07:35,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {422#(= (mod main_~z~0 2) 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {422#(= (mod main_~z~0 2) 0)} is VALID [2022-04-15 01:07:35,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {422#(= (mod main_~z~0 2) 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {422#(= (mod main_~z~0 2) 0)} is VALID [2022-04-15 01:07:35,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {422#(= (mod main_~z~0 2) 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {422#(= (mod main_~z~0 2) 0)} is VALID [2022-04-15 01:07:35,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {422#(= (mod main_~z~0 2) 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {422#(= (mod main_~z~0 2) 0)} is VALID [2022-04-15 01:07:35,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {350#true} [51] mainENTRY-->L10-2: Formula: (and (= v_main_~y~0_2 10000000) (= v_main_~z~0_3 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {422#(= (mod main_~z~0 2) 0)} is VALID [2022-04-15 01:07:35,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {350#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {350#true} is VALID [2022-04-15 01:07:35,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {350#true} {350#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {350#true} is VALID [2022-04-15 01:07:35,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {350#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {350#true} is VALID [2022-04-15 01:07:35,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {350#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {350#true} is VALID [2022-04-15 01:07:35,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {350#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {350#true} is VALID [2022-04-15 01:07:35,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 01:07:35,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247704206] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 01:07:35,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 01:07:35,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 10 [2022-04-15 01:07:35,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699528085] [2022-04-15 01:07:35,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:07:35,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 01:07:35,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:07:35,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:35,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:07:35,537 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 01:07:35,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:07:35,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 01:07:35,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-15 01:07:35,538 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:35,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:07:35,576 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 01:07:35,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 01:07:35,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 01:07:35,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:07:35,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:35,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2022-04-15 01:07:35,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:35,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2022-04-15 01:07:35,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 15 transitions. [2022-04-15 01:07:35,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:07:35,591 INFO L225 Difference]: With dead ends: 19 [2022-04-15 01:07:35,591 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 01:07:35,591 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-15 01:07:35,592 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:07:35,592 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 36 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:07:35,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 01:07:35,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 01:07:35,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:07:35,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 01:07:35,593 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 01:07:35,594 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 01:07:35,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:07:35,594 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 01:07:35,594 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:07:35,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:07:35,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:07:35,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 01:07:35,594 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 01:07:35,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:07:35,595 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 01:07:35,595 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:07:35,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:07:35,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:07:35,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:07:35,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:07:35,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 01:07:35,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 01:07:35,596 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-04-15 01:07:35,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:07:35,596 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 01:07:35,596 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:35,596 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:07:35,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:07:35,599 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 01:07:35,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 01:07:35,803 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:07:35,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 01:07:35,833 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 01:07:35,834 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 01:07:35,834 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 01:07:35,834 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 01:07:35,834 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 01:07:35,834 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 01:07:35,834 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 01:07:35,834 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 17) the Hoare annotation is: true [2022-04-15 01:07:35,834 INFO L878 garLoopResultBuilder]: At program point L10-2(lines 10 14) the Hoare annotation is: (= (mod main_~z~0 2) 0) [2022-04-15 01:07:35,834 INFO L878 garLoopResultBuilder]: At program point L10-3(lines 10 14) the Hoare annotation is: (= (mod main_~z~0 2) 0) [2022-04-15 01:07:35,834 INFO L882 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2022-04-15 01:07:35,835 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-15 01:07:35,835 INFO L882 garLoopResultBuilder]: For program point L11-2(lines 11 12) no Hoare annotation was computed. [2022-04-15 01:07:35,835 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 6 17) no Hoare annotation was computed. [2022-04-15 01:07:35,835 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 6 17) no Hoare annotation was computed. [2022-04-15 01:07:35,835 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(line 4) the Hoare annotation is: true [2022-04-15 01:07:35,835 INFO L882 garLoopResultBuilder]: For program point L4(line 4) no Hoare annotation was computed. [2022-04-15 01:07:35,835 INFO L882 garLoopResultBuilder]: For program point L4-1(line 4) no Hoare annotation was computed. [2022-04-15 01:07:35,835 INFO L882 garLoopResultBuilder]: For program point L4-3(line 4) no Hoare annotation was computed. [2022-04-15 01:07:35,835 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2022-04-15 01:07:35,836 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(line 4) no Hoare annotation was computed. [2022-04-15 01:07:35,838 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-15 01:07:35,847 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 01:07:35,851 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 01:07:35,852 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2022-04-15 01:07:35,852 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 01:07:35,853 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-15 01:07:35,853 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2022-04-15 01:07:35,853 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2022-04-15 01:07:35,853 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 01:07:35,853 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-15 01:07:35,853 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-15 01:07:35,853 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2022-04-15 01:07:35,853 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2022-04-15 01:07:35,853 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2022-04-15 01:07:35,853 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-15 01:07:35,853 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 01:07:35,853 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 01:07:35,853 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 01:07:35,854 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 01:07:35,854 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 01:07:35,854 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 01:07:35,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:07:35 BasicIcfg [2022-04-15 01:07:35,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 01:07:35,864 INFO L158 Benchmark]: Toolchain (without parser) took 2599.68ms. Allocated memory was 184.5MB in the beginning and 266.3MB in the end (delta: 81.8MB). Free memory was 126.5MB in the beginning and 192.6MB in the end (delta: -66.1MB). Peak memory consumption was 15.8MB. Max. memory is 8.0GB. [2022-04-15 01:07:35,864 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 01:07:35,865 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.08ms. Allocated memory was 184.5MB in the beginning and 266.3MB in the end (delta: 81.8MB). Free memory was 126.4MB in the beginning and 239.5MB in the end (delta: -113.1MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. [2022-04-15 01:07:35,866 INFO L158 Benchmark]: Boogie Preprocessor took 34.70ms. Allocated memory is still 266.3MB. Free memory was 239.5MB in the beginning and 237.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 01:07:35,866 INFO L158 Benchmark]: RCFGBuilder took 213.53ms. Allocated memory is still 266.3MB. Free memory was 237.8MB in the beginning and 227.5MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 01:07:35,866 INFO L158 Benchmark]: IcfgTransformer took 20.68ms. Allocated memory is still 266.3MB. Free memory was 227.5MB in the beginning and 226.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 01:07:35,867 INFO L158 Benchmark]: TraceAbstraction took 2098.48ms. Allocated memory is still 266.3MB. Free memory was 225.9MB in the beginning and 192.6MB in the end (delta: 33.2MB). Peak memory consumption was 33.8MB. Max. memory is 8.0GB. [2022-04-15 01:07:35,869 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.08ms. Allocated memory was 184.5MB in the beginning and 266.3MB in the end (delta: 81.8MB). Free memory was 126.4MB in the beginning and 239.5MB in the end (delta: -113.1MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.70ms. Allocated memory is still 266.3MB. Free memory was 239.5MB in the beginning and 237.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 213.53ms. Allocated memory is still 266.3MB. Free memory was 237.8MB in the beginning and 227.5MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 20.68ms. Allocated memory is still 266.3MB. Free memory was 227.5MB in the beginning and 226.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2098.48ms. Allocated memory is still 266.3MB. Free memory was 225.9MB in the beginning and 192.6MB in the end (delta: 33.2MB). Peak memory consumption was 33.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 4]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 58 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 15 NumberOfFragments, 21 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 26 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 81 ConstructedInterpolants, 0 QuantifiedInterpolants, 203 SizeOfPredicates, 1 NumberOfNonLiveVariables, 65 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 11/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: z % 2 == 0 RESULT: Ultimate proved your program to be correct! [2022-04-15 01:07:35,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...