/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/loop-invariants/mod4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 22:32:23,018 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 22:32:23,020 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 22:32:23,068 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 22:32:23,068 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 22:32:23,069 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 22:32:23,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 22:32:23,071 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 22:32:23,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 22:32:23,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 22:32:23,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 22:32:23,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 22:32:23,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 22:32:23,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 22:32:23,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 22:32:23,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 22:32:23,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 22:32:23,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 22:32:23,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 22:32:23,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 22:32:23,094 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 22:32:23,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 22:32:23,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 22:32:23,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 22:32:23,108 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 22:32:23,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 22:32:23,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 22:32:23,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 22:32:23,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 22:32:23,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 22:32:23,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 22:32:23,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 22:32:23,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 22:32:23,112 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 22:32:23,113 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 22:32:23,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 22:32:23,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 22:32:23,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 22:32:23,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 22:32:23,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 22:32:23,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 22:32:23,117 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 22:32:23,117 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 22:32:23,136 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 22:32:23,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 22:32:23,138 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 22:32:23,138 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 22:32:23,138 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 22:32:23,139 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 22:32:23,139 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 22:32:23,139 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 22:32:23,139 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 22:32:23,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 22:32:23,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 22:32:23,140 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 22:32:23,140 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 22:32:23,140 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 22:32:23,140 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 22:32:23,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 22:32:23,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 22:32:23,140 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 22:32:23,140 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 22:32:23,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:32:23,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 22:32:23,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 22:32:23,141 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 22:32:23,141 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 22:32:23,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 22:32:23,141 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 22:32:23,141 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 22:32:23,141 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 22:32:23,142 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 22:32:23,142 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-27 22:32:23,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 22:32:23,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 22:32:23,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 22:32:23,338 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 22:32:23,339 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 22:32:23,340 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invariants/mod4.c [2022-04-27 22:32:23,379 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2942bae80/ea9b932c961d445eba02f05f011692d0/FLAGf912736c1 [2022-04-27 22:32:23,709 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 22:32:23,710 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/mod4.c [2022-04-27 22:32:23,715 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2942bae80/ea9b932c961d445eba02f05f011692d0/FLAGf912736c1 [2022-04-27 22:32:23,727 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2942bae80/ea9b932c961d445eba02f05f011692d0 [2022-04-27 22:32:23,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 22:32:23,732 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 22:32:23,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 22:32:23,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 22:32:23,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 22:32:23,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:32:23" (1/1) ... [2022-04-27 22:32:23,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f94b9b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:32:23, skipping insertion in model container [2022-04-27 22:32:23,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:32:23" (1/1) ... [2022-04-27 22:32:23,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 22:32:23,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 22:32:23,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/mod4.c[351,364] [2022-04-27 22:32:23,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:32:23,935 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 22:32:23,947 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/mod4.c[351,364] [2022-04-27 22:32:23,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:32:23,960 INFO L208 MainTranslator]: Completed translation [2022-04-27 22:32:23,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:32:23 WrapperNode [2022-04-27 22:32:23,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 22:32:23,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 22:32:23,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 22:32:23,963 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 22:32:23,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:32:23" (1/1) ... [2022-04-27 22:32:23,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:32:23" (1/1) ... [2022-04-27 22:32:23,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:32:23" (1/1) ... [2022-04-27 22:32:23,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:32:23" (1/1) ... [2022-04-27 22:32:23,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:32:23" (1/1) ... [2022-04-27 22:32:23,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:32:23" (1/1) ... [2022-04-27 22:32:23,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:32:23" (1/1) ... [2022-04-27 22:32:23,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 22:32:23,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 22:32:23,993 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 22:32:23,993 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 22:32:23,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:32:23" (1/1) ... [2022-04-27 22:32:24,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:32:24,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:32:24,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 22:32:24,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 22:32:24,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 22:32:24,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 22:32:24,043 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 22:32:24,043 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 22:32:24,043 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 22:32:24,043 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 22:32:24,051 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 22:32:24,052 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 22:32:24,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 22:32:24,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 22:32:24,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 22:32:24,052 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 22:32:24,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 22:32:24,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 22:32:24,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 22:32:24,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 22:32:24,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 22:32:24,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 22:32:24,096 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 22:32:24,097 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 22:32:24,172 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 22:32:24,176 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 22:32:24,176 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 22:32:24,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:32:24 BoogieIcfgContainer [2022-04-27 22:32:24,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 22:32:24,178 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 22:32:24,178 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 22:32:24,179 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 22:32:24,181 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:32:24" (1/1) ... [2022-04-27 22:32:24,182 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 22:32:24,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:32:24 BasicIcfg [2022-04-27 22:32:24,194 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 22:32:24,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 22:32:24,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 22:32:24,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 22:32:24,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:32:23" (1/4) ... [2022-04-27 22:32:24,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43dffc9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:32:24, skipping insertion in model container [2022-04-27 22:32:24,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:32:23" (2/4) ... [2022-04-27 22:32:24,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43dffc9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:32:24, skipping insertion in model container [2022-04-27 22:32:24,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:32:24" (3/4) ... [2022-04-27 22:32:24,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43dffc9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:32:24, skipping insertion in model container [2022-04-27 22:32:24,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:32:24" (4/4) ... [2022-04-27 22:32:24,199 INFO L111 eAbstractionObserver]: Analyzing ICFG mod4.cqvasr [2022-04-27 22:32:24,218 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 22:32:24,218 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 22:32:24,276 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 22:32:24,280 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@17ca4d4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@353d7c3e [2022-04-27 22:32:24,280 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 22:32:24,286 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 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-27 22:32:24,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 22:32:24,290 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:32:24,290 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:32:24,291 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:32:24,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:32:24,294 INFO L85 PathProgramCache]: Analyzing trace with hash -487068095, now seen corresponding path program 1 times [2022-04-27 22:32:24,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:32:24,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144861368] [2022-04-27 22:32:24,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:32:24,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:32:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:32:24,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:32:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:32:24,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= 48 (select .cse0 0)) (= 111 (select .cse1 1)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (= (select .cse1 2) 100) (< 0 |v_#StackHeapBarrier_1|) (= (select .cse1 3) 52) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 109 (select .cse1 0)) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse1 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse1 4) 46))) 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] {23#true} is VALID [2022-04-27 22:32:24,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 22:32:24,491 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [60] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 22:32:24,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:32:24,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= 48 (select .cse0 0)) (= 111 (select .cse1 1)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (= (select .cse1 2) 100) (< 0 |v_#StackHeapBarrier_1|) (= (select .cse1 3) 52) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 109 (select .cse1 0)) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse1 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse1 4) 46))) 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] {23#true} is VALID [2022-04-27 22:32:24,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 22:32:24,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [60] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 22:32:24,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 22:32:24,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [45] mainENTRY-->L13-3: Formula: (= v_main_~x~0_2 0) InVars {} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0] {23#true} is VALID [2022-04-27 22:32:24,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [47] L13-3-->L13-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-27 22:32:24,499 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} [49] L13-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_5 4) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {24#false} is VALID [2022-04-27 22:32:24,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} [53] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {24#false} is VALID [2022-04-27 22:32:24,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [55] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-27 22:32:24,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [57] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-27 22:32:24,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:32:24,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:32:24,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144861368] [2022-04-27 22:32:24,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144861368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:32:24,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:32:24,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 22:32:24,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577490652] [2022-04-27 22:32:24,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:32:24,508 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-27 22:32:24,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:32:24,511 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-27 22:32:24,530 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-27 22:32:24,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 22:32:24,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:32:24,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 22:32:24,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:32:24,552 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 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-27 22:32:24,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:32:24,629 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-27 22:32:24,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 22:32:24,630 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-27 22:32:24,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:32:24,631 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-27 22:32:24,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-27 22:32:24,639 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-27 22:32:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-27 22:32:24,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-04-27 22:32:24,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:32:24,694 INFO L225 Difference]: With dead ends: 32 [2022-04-27 22:32:24,694 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 22:32:24,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:32:24,700 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 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-27 22:32:24,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:32:24,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 22:32:24,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 22:32:24,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:32:24,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:32:24,729 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:32:24,729 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:32:24,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:32:24,735 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 22:32:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 22:32:24,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:32:24,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:32:24,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-27 22:32:24,736 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-27 22:32:24,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:32:24,739 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 22:32:24,739 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 22:32:24,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:32:24,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:32:24,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:32:24,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:32:24,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:32:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 22:32:24,743 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-27 22:32:24,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:32:24,745 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 22:32:24,747 INFO L496 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-27 22:32:24,747 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 22:32:24,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 22:32:24,753 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:32:24,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:32:24,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 22:32:24,754 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:32:24,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:32:24,755 INFO L85 PathProgramCache]: Analyzing trace with hash 2110189820, now seen corresponding path program 1 times [2022-04-27 22:32:24,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:32:24,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955867572] [2022-04-27 22:32:24,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:32:24,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:32:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:32:24,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:32:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:32:24,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= 48 (select .cse0 0)) (= 111 (select .cse1 1)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (= (select .cse1 2) 100) (< 0 |v_#StackHeapBarrier_1|) (= (select .cse1 3) 52) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 109 (select .cse1 0)) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse1 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse1 4) 46))) 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] {118#true} is VALID [2022-04-27 22:32:24,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-27 22:32:24,853 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118#true} {118#true} [60] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-27 22:32:24,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {118#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:32:24,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= 48 (select .cse0 0)) (= 111 (select .cse1 1)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (= (select .cse1 2) 100) (< 0 |v_#StackHeapBarrier_1|) (= (select .cse1 3) 52) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 109 (select .cse1 0)) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse1 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse1 4) 46))) 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] {118#true} is VALID [2022-04-27 22:32:24,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-27 22:32:24,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118#true} {118#true} [60] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-27 22:32:24,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {118#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#true} is VALID [2022-04-27 22:32:24,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {118#true} [45] mainENTRY-->L13-3: Formula: (= v_main_~x~0_2 0) InVars {} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0] {123#(= main_~x~0 0)} is VALID [2022-04-27 22:32:24,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {123#(= main_~x~0 0)} [48] L13-3-->L13-1: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {123#(= main_~x~0 0)} is VALID [2022-04-27 22:32:24,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {123#(= main_~x~0 0)} [50] L13-1-->L13-4: Formula: (= |v_main_#t~nondet4_3| 0) InVars {main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet4] {123#(= main_~x~0 0)} is VALID [2022-04-27 22:32:24,857 INFO L272 TraceCheckUtils]: 8: Hoare triple {123#(= main_~x~0 0)} [49] L13-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_5 4) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {124#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:32:24,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {124#(not (= |__VERIFIER_assert_#in~cond| 0))} [53] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {125#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 22:32:24,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {125#(not (= __VERIFIER_assert_~cond 0))} [55] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {119#false} is VALID [2022-04-27 22:32:24,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {119#false} [57] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {119#false} is VALID [2022-04-27 22:32:24,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:32:24,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:32:24,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955867572] [2022-04-27 22:32:24,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955867572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:32:24,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:32:24,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 22:32:24,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717376133] [2022-04-27 22:32:24,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:32:24,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 22:32:24,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:32:24,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:32:24,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:32:24,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 22:32:24,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:32:24,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 22:32:24,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 22:32:24,871 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:32:24,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:32:24,983 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-27 22:32:24,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 22:32:24,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 22:32:24,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:32:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:32:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-27 22:32:24,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:32:24,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-27 22:32:24,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-27 22:32:25,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:32:25,010 INFO L225 Difference]: With dead ends: 20 [2022-04-27 22:32:25,010 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 22:32:25,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 22:32:25,013 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:32:25,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 28 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:32:25,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 22:32:25,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 22:32:25,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:32:25,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:32:25,019 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:32:25,019 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:32:25,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:32:25,021 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 22:32:25,021 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 22:32:25,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:32:25,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:32:25,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 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 15 states. [2022-04-27 22:32:25,022 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 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 15 states. [2022-04-27 22:32:25,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:32:25,023 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 22:32:25,023 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 22:32:25,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:32:25,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:32:25,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:32:25,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:32:25,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:32:25,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-27 22:32:25,026 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-27 22:32:25,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:32:25,026 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-27 22:32:25,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:32:25,027 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 22:32:25,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 22:32:25,027 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:32:25,027 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:32:25,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 22:32:25,028 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:32:25,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:32:25,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1523776447, now seen corresponding path program 1 times [2022-04-27 22:32:25,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:32:25,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924533500] [2022-04-27 22:32:25,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:32:25,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:32:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:32:25,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:32:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:32:25,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {227#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= 48 (select .cse0 0)) (= 111 (select .cse1 1)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (= (select .cse1 2) 100) (< 0 |v_#StackHeapBarrier_1|) (= (select .cse1 3) 52) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 109 (select .cse1 0)) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse1 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse1 4) 46))) 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] {218#true} is VALID [2022-04-27 22:32:25,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-27 22:32:25,175 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {218#true} {218#true} [60] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-27 22:32:25,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {218#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {227#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:32:25,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= 48 (select .cse0 0)) (= 111 (select .cse1 1)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (= (select .cse1 2) 100) (< 0 |v_#StackHeapBarrier_1|) (= (select .cse1 3) 52) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 109 (select .cse1 0)) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse1 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse1 4) 46))) 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] {218#true} is VALID [2022-04-27 22:32:25,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {218#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-27 22:32:25,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {218#true} {218#true} [60] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-27 22:32:25,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {218#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-27 22:32:25,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {218#true} [45] mainENTRY-->L13-3: Formula: (= v_main_~x~0_2 0) InVars {} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0] {223#(= main_~x~0 0)} is VALID [2022-04-27 22:32:25,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {223#(= main_~x~0 0)} [48] L13-3-->L13-1: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {223#(= main_~x~0 0)} is VALID [2022-04-27 22:32:25,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {223#(= main_~x~0 0)} [51] L13-1-->L13-3: Formula: (and (= (+ v_main_~x~0_4 4) v_main_~x~0_3) (not (= |v_main_#t~nondet4_5| 0))) InVars {main_~x~0=v_main_~x~0_4, main_#t~nondet4=|v_main_#t~nondet4_5|} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0] {224#(and (<= main_~x~0 (* (div main_~x~0 4) 4)) (not (<= (div main_~x~0 4) 0)))} is VALID [2022-04-27 22:32:25,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {224#(and (<= main_~x~0 (* (div main_~x~0 4) 4)) (not (<= (div main_~x~0 4) 0)))} [48] L13-3-->L13-1: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {224#(and (<= main_~x~0 (* (div main_~x~0 4) 4)) (not (<= (div main_~x~0 4) 0)))} is VALID [2022-04-27 22:32:25,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {224#(and (<= main_~x~0 (* (div main_~x~0 4) 4)) (not (<= (div main_~x~0 4) 0)))} [50] L13-1-->L13-4: Formula: (= |v_main_#t~nondet4_3| 0) InVars {main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet4] {224#(and (<= main_~x~0 (* (div main_~x~0 4) 4)) (not (<= (div main_~x~0 4) 0)))} is VALID [2022-04-27 22:32:25,181 INFO L272 TraceCheckUtils]: 10: Hoare triple {224#(and (<= main_~x~0 (* (div main_~x~0 4) 4)) (not (<= (div main_~x~0 4) 0)))} [49] L13-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_5 4) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {225#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:32:25,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {225#(not (= |__VERIFIER_assert_#in~cond| 0))} [53] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {226#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 22:32:25,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {226#(not (= __VERIFIER_assert_~cond 0))} [55] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {219#false} is VALID [2022-04-27 22:32:25,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {219#false} [57] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219#false} is VALID [2022-04-27 22:32:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:32:25,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:32:25,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924533500] [2022-04-27 22:32:25,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924533500] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:32:25,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311808778] [2022-04-27 22:32:25,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:32:25,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:32:25,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:32:25,195 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:32:25,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 22:32:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:32:25,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 22:32:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:32:25,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:32:25,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {218#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-27 22:32:25,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#true} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= 48 (select .cse0 0)) (= 111 (select .cse1 1)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (= (select .cse1 2) 100) (< 0 |v_#StackHeapBarrier_1|) (= (select .cse1 3) 52) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 109 (select .cse1 0)) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse1 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse1 4) 46))) 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] {218#true} is VALID [2022-04-27 22:32:25,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {218#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-27 22:32:25,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {218#true} {218#true} [60] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-27 22:32:25,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {218#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-27 22:32:25,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {218#true} [45] mainENTRY-->L13-3: Formula: (= v_main_~x~0_2 0) InVars {} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0] {223#(= main_~x~0 0)} is VALID [2022-04-27 22:32:25,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {223#(= main_~x~0 0)} [48] L13-3-->L13-1: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {223#(= main_~x~0 0)} is VALID [2022-04-27 22:32:25,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {223#(= main_~x~0 0)} [51] L13-1-->L13-3: Formula: (and (= (+ v_main_~x~0_4 4) v_main_~x~0_3) (not (= |v_main_#t~nondet4_5| 0))) InVars {main_~x~0=v_main_~x~0_4, main_#t~nondet4=|v_main_#t~nondet4_5|} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0] {252#(= (+ main_~x~0 (- 4)) 0)} is VALID [2022-04-27 22:32:25,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {252#(= (+ main_~x~0 (- 4)) 0)} [48] L13-3-->L13-1: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {252#(= (+ main_~x~0 (- 4)) 0)} is VALID [2022-04-27 22:32:25,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {252#(= (+ main_~x~0 (- 4)) 0)} [50] L13-1-->L13-4: Formula: (= |v_main_#t~nondet4_3| 0) InVars {main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet4] {252#(= (+ main_~x~0 (- 4)) 0)} is VALID [2022-04-27 22:32:25,382 INFO L272 TraceCheckUtils]: 10: Hoare triple {252#(= (+ main_~x~0 (- 4)) 0)} [49] L13-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_5 4) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {262#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:32:25,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {262#(<= 1 |__VERIFIER_assert_#in~cond|)} [53] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {266#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:32:25,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {266#(<= 1 __VERIFIER_assert_~cond)} [55] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {219#false} is VALID [2022-04-27 22:32:25,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {219#false} [57] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219#false} is VALID [2022-04-27 22:32:25,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:32:25,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:32:25,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {219#false} [57] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219#false} is VALID [2022-04-27 22:32:25,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {266#(<= 1 __VERIFIER_assert_~cond)} [55] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {219#false} is VALID [2022-04-27 22:32:25,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {262#(<= 1 |__VERIFIER_assert_#in~cond|)} [53] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {266#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:32:25,503 INFO L272 TraceCheckUtils]: 10: Hoare triple {282#(= (mod main_~x~0 4) 0)} [49] L13-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_5 4) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {262#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:32:25,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(= (mod main_~x~0 4) 0)} [50] L13-1-->L13-4: Formula: (= |v_main_#t~nondet4_3| 0) InVars {main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet4] {282#(= (mod main_~x~0 4) 0)} is VALID [2022-04-27 22:32:25,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#(= (mod main_~x~0 4) 0)} [48] L13-3-->L13-1: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {282#(= (mod main_~x~0 4) 0)} is VALID [2022-04-27 22:32:25,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#(= (mod main_~x~0 4) 0)} [51] L13-1-->L13-3: Formula: (and (= (+ v_main_~x~0_4 4) v_main_~x~0_3) (not (= |v_main_#t~nondet4_5| 0))) InVars {main_~x~0=v_main_~x~0_4, main_#t~nondet4=|v_main_#t~nondet4_5|} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0] {282#(= (mod main_~x~0 4) 0)} is VALID [2022-04-27 22:32:25,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {282#(= (mod main_~x~0 4) 0)} [48] L13-3-->L13-1: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {282#(= (mod main_~x~0 4) 0)} is VALID [2022-04-27 22:32:25,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {218#true} [45] mainENTRY-->L13-3: Formula: (= v_main_~x~0_2 0) InVars {} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0] {282#(= (mod main_~x~0 4) 0)} is VALID [2022-04-27 22:32:25,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {218#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-27 22:32:25,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {218#true} {218#true} [60] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-27 22:32:25,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {218#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-27 22:32:25,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#true} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= 48 (select .cse0 0)) (= 111 (select .cse1 1)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (= (select .cse1 2) 100) (< 0 |v_#StackHeapBarrier_1|) (= (select .cse1 3) 52) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= 109 (select .cse1 0)) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse1 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse1 4) 46))) 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] {218#true} is VALID [2022-04-27 22:32:25,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {218#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-27 22:32:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 22:32:25,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311808778] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 22:32:25,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 22:32:25,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 6] total 11 [2022-04-27 22:32:25,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995685190] [2022-04-27 22:32:25,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:32:25,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 14 [2022-04-27 22:32:25,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:32:25,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:32:25,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:32:25,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 22:32:25,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:32:25,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 22:32:25,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 22:32:25,530 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:32:25,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:32:25,565 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 22:32:25,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 22:32:25,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 14 [2022-04-27 22:32:25,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:32:25,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:32:25,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2022-04-27 22:32:25,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:32:25,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2022-04-27 22:32:25,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 13 transitions. [2022-04-27 22:32:25,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:32:25,578 INFO L225 Difference]: With dead ends: 15 [2022-04-27 22:32:25,578 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 22:32:25,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-27 22:32:25,579 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 30 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-27 22:32:25,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 30 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:32:25,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 22:32:25,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 22:32:25,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:32:25,580 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-27 22:32:25,580 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-27 22:32:25,580 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-27 22:32:25,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:32:25,580 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 22:32:25,580 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:32:25,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:32:25,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:32:25,581 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-27 22:32:25,581 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-27 22:32:25,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:32:25,581 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 22:32:25,581 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:32:25,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:32:25,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:32:25,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:32:25,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:32:25,581 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-27 22:32:25,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 22:32:25,582 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-27 22:32:25,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:32:25,582 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 22:32:25,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:32:25,582 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 22:32:25,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:32:25,584 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 22:32:25,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 22:32:25,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:32:25,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 22:32:25,823 INFO L895 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-27 22:32:25,824 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 22:32:25,824 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 22:32:25,824 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 22:32:25,824 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 22:32:25,824 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 22:32:25,824 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 22:32:25,824 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 11 18) the Hoare annotation is: true [2022-04-27 22:32:25,824 INFO L895 garLoopResultBuilder]: At program point L13-3(lines 13 15) the Hoare annotation is: (= (mod main_~x~0 4) 0) [2022-04-27 22:32:25,824 INFO L895 garLoopResultBuilder]: At program point L13-4(lines 13 15) the Hoare annotation is: (= (mod main_~x~0 4) 0) [2022-04-27 22:32:25,824 INFO L899 garLoopResultBuilder]: For program point L13-1(lines 13 15) no Hoare annotation was computed. [2022-04-27 22:32:25,824 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-27 22:32:25,825 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 11 18) no Hoare annotation was computed. [2022-04-27 22:32:25,825 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 11 18) no Hoare annotation was computed. [2022-04-27 22:32:25,825 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-27 22:32:25,825 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2022-04-27 22:32:25,825 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 22:32:25,825 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2022-04-27 22:32:25,825 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2022-04-27 22:32:25,825 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2022-04-27 22:32:25,827 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 22:32:25,829 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 22:32:25,831 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 22:32:25,832 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 22:32:25,832 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 22:32:25,832 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2022-04-27 22:32:25,832 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 22:32:25,832 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 22:32:25,832 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 22:32:25,833 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2022-04-27 22:32:25,833 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2022-04-27 22:32:25,833 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 22:32:25,833 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 22:32:25,833 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-27 22:32:25,833 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 22:32:25,833 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 22:32:25,833 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 22:32:25,833 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 22:32:25,833 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 22:32:25,833 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 22:32:25,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:32:25 BasicIcfg [2022-04-27 22:32:25,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 22:32:25,840 INFO L158 Benchmark]: Toolchain (without parser) took 2107.50ms. Allocated memory is still 205.5MB. Free memory was 155.0MB in the beginning and 78.2MB in the end (delta: 76.7MB). Peak memory consumption was 76.0MB. Max. memory is 8.0GB. [2022-04-27 22:32:25,840 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 205.5MB. Free memory was 171.1MB in the beginning and 171.0MB in the end (delta: 71.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 22:32:25,840 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.88ms. Allocated memory is still 205.5MB. Free memory was 154.8MB in the beginning and 183.1MB in the end (delta: -28.3MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. [2022-04-27 22:32:25,840 INFO L158 Benchmark]: Boogie Preprocessor took 29.70ms. Allocated memory is still 205.5MB. Free memory was 183.1MB in the beginning and 182.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 22:32:25,840 INFO L158 Benchmark]: RCFGBuilder took 184.37ms. Allocated memory is still 205.5MB. Free memory was 181.5MB in the beginning and 171.6MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-27 22:32:25,841 INFO L158 Benchmark]: IcfgTransformer took 16.26ms. Allocated memory is still 205.5MB. Free memory was 171.6MB in the beginning and 170.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 22:32:25,841 INFO L158 Benchmark]: TraceAbstraction took 1643.50ms. Allocated memory is still 205.5MB. Free memory was 170.0MB in the beginning and 78.2MB in the end (delta: 91.7MB). Peak memory consumption was 91.2MB. Max. memory is 8.0GB. [2022-04-27 22:32:25,842 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.09ms. Allocated memory is still 205.5MB. Free memory was 171.1MB in the beginning and 171.0MB in the end (delta: 71.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 228.88ms. Allocated memory is still 205.5MB. Free memory was 154.8MB in the beginning and 183.1MB in the end (delta: -28.3MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.70ms. Allocated memory is still 205.5MB. Free memory was 183.1MB in the beginning and 182.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 184.37ms. Allocated memory is still 205.5MB. Free memory was 181.5MB in the beginning and 171.6MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 16.26ms. Allocated memory is still 205.5MB. Free memory was 171.6MB in the beginning and 170.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1643.50ms. Allocated memory is still 205.5MB. Free memory was 170.0MB in the beginning and 78.2MB in the end (delta: 91.7MB). Peak memory consumption was 91.2MB. 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: 7]: 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, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 39 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 12 NumberOfFragments, 21 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 14 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 183 SizeOfPredicates, 1 NumberOfNonLiveVariables, 73 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 2/6 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: 13]: Loop Invariant Derived loop invariant: x % 4 == 0 RESULT: Ultimate proved your program to be correct! [2022-04-27 22:32:25,866 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...