/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-industry-pattern/mod3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:49:52,099 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:49:52,101 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:49:52,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:49:52,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:49:52,126 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:49:52,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:49:52,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:49:52,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:49:52,139 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:49:52,140 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:49:52,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:49:52,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:49:52,142 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:49:52,143 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:49:52,144 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:49:52,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:49:52,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:49:52,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:49:52,152 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:49:52,156 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:49:52,159 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:49:52,161 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:49:52,163 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:49:52,166 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:49:52,172 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:49:52,173 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:49:52,173 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:49:52,174 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:49:52,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:49:52,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:49:52,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:49:52,177 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:49:52,177 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:49:52,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:49:52,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:49:52,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:49:52,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:49:52,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:49:52,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:49:52,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:49:52,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:49:52,182 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 21:49:52,209 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:49:52,210 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:49:52,210 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:49:52,210 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:49:52,211 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:49:52,211 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:49:52,212 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:49:52,212 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:49:52,212 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:49:52,212 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:49:52,213 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:49:52,213 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:49:52,213 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:49:52,213 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:49:52,213 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:49:52,213 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:49:52,213 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:49:52,213 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:49:52,213 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:49:52,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:49:52,214 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:49:52,214 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:49:52,214 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:49:52,214 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:49:52,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:49:52,214 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:49:52,215 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:49:52,215 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:49:52,216 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:49:52,216 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 21:49:52,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:49:52,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:49:52,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:49:52,481 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:49:52,481 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:49:52,482 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/mod3.c [2022-04-27 21:49:52,543 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0febf2b2/234fcd055314402a9c6088c88c3fcbea/FLAG8913d6b57 [2022-04-27 21:49:52,924 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:49:52,924 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c [2022-04-27 21:49:52,929 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0febf2b2/234fcd055314402a9c6088c88c3fcbea/FLAG8913d6b57 [2022-04-27 21:49:52,938 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0febf2b2/234fcd055314402a9c6088c88c3fcbea [2022-04-27 21:49:52,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:49:52,941 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:49:52,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:49:52,942 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:49:52,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:49:52,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:49:52" (1/1) ... [2022-04-27 21:49:52,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bba540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:49:52, skipping insertion in model container [2022-04-27 21:49:52,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:49:52" (1/1) ... [2022-04-27 21:49:52,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:49:52,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:49:53,088 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-industry-pattern/mod3.c[394,407] [2022-04-27 21:49:53,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:49:53,110 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:49:53,136 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-industry-pattern/mod3.c[394,407] [2022-04-27 21:49:53,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:49:53,152 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:49:53,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:49:53 WrapperNode [2022-04-27 21:49:53,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:49:53,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:49:53,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:49:53,154 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:49:53,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:49:53" (1/1) ... [2022-04-27 21:49:53,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:49:53" (1/1) ... [2022-04-27 21:49:53,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:49:53" (1/1) ... [2022-04-27 21:49:53,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:49:53" (1/1) ... [2022-04-27 21:49:53,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:49:53" (1/1) ... [2022-04-27 21:49:53,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:49:53" (1/1) ... [2022-04-27 21:49:53,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:49:53" (1/1) ... [2022-04-27 21:49:53,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:49:53,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:49:53,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:49:53,190 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:49:53,199 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:49:53" (1/1) ... [2022-04-27 21:49:53,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:49:53,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:49:53,232 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 21:49:53,240 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 21:49:53,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:49:53,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:49:53,276 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:49:53,276 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:49:53,277 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:49:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:49:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:49:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:49:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:49:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:49:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:49:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:49:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:49:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:49:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:49:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:49:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:49:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:49:53,334 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:49:53,335 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:49:57,789 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:49:57,796 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:49:57,796 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 21:49:57,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:49:57 BoogieIcfgContainer [2022-04-27 21:49:57,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:49:57,798 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:49:57,798 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:49:57,799 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:49:57,802 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:49:57" (1/1) ... [2022-04-27 21:49:57,804 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:49:57,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:49:57 BasicIcfg [2022-04-27 21:49:57,827 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:49:57,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:49:57,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:49:57,831 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:49:57,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:49:52" (1/4) ... [2022-04-27 21:49:57,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b5eff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:49:57, skipping insertion in model container [2022-04-27 21:49:57,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:49:53" (2/4) ... [2022-04-27 21:49:57,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b5eff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:49:57, skipping insertion in model container [2022-04-27 21:49:57,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:49:57" (3/4) ... [2022-04-27 21:49:57,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b5eff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:49:57, skipping insertion in model container [2022-04-27 21:49:57,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:49:57" (4/4) ... [2022-04-27 21:49:57,833 INFO L111 eAbstractionObserver]: Analyzing ICFG mod3.cqvasr [2022-04-27 21:49:57,845 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:49:57,845 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:49:57,881 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:49:57,887 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@5e1609c6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@ebe6ec6 [2022-04-27 21:49:57,887 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:49:57,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.5) internal successors, (24), 18 states have internal predecessors, (24), 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 21:49:57,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:49:57,900 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:49:57,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:49:57,901 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:49:57,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:49:57,905 INFO L85 PathProgramCache]: Analyzing trace with hash -281797978, now seen corresponding path program 1 times [2022-04-27 21:49:57,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:49:57,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051004152] [2022-04-27 21:49:57,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:49:57,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:49:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:49:58,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:49:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:49:58,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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|) (= |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) (= 51 (select .cse1 3)) (= 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] {27#true} is VALID [2022-04-27 21:49:58,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 21:49:58,076 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} [90] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 21:49:58,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:49:58,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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|) (= |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) (= 51 (select .cse1 3)) (= 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] {27#true} is VALID [2022-04-27 21:49:58,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 21:49:58,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} [90] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 21:49:58,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 21:49:58,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} [67] mainENTRY-->L25-2: Formula: (and (= v_main_~y~0_1 1) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {27#true} is VALID [2022-04-27 21:49:58,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} [69] L25-2-->L18-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-27 21:49:58,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} [71] L18-3-->L33: Formula: (= (mod v_main_~y~0_2 4294967296) 0) InVars {main_~y~0=v_main_~y~0_2} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-27 21:49:58,081 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#false} [75] L33-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (mod (mod v_main_~x~0_13 4294967296) 3) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {28#false} is VALID [2022-04-27 21:49:58,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} [79] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {28#false} is VALID [2022-04-27 21:49:58,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} [83] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-27 21:49:58,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} [87] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-27 21:49:58,082 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 21:49:58,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:49:58,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051004152] [2022-04-27 21:49:58,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051004152] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:49:58,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:49:58,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:49:58,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631532068] [2022-04-27 21:49:58,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:49:58,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:49:58,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:49:58,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:49:58,110 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 21:49:58,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:49:58,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:49:58,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:49:58,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:49:58,130 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.5) internal successors, (24), 18 states have internal predecessors, (24), 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.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:50:06,733 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:50:06,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:50:06,905 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-04-27 21:50:06,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:50:06,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:50:06,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:50:06,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:50:06,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-27 21:50:06,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:50:06,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-27 21:50:06,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-04-27 21:50:06,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:50:06,997 INFO L225 Difference]: With dead ends: 38 [2022-04-27 21:50:06,998 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 21:50:07,000 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 21:50:07,003 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:50:07,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 30 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 21:50:07,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 21:50:07,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 21:50:07,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:50:07,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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 21:50:07,029 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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 21:50:07,029 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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 21:50:07,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:50:07,032 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-27 21:50:07,032 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-27 21:50:07,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:50:07,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:50:07,033 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 21:50:07,033 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 21:50:07,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:50:07,035 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-27 21:50:07,036 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-27 21:50:07,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:50:07,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:50:07,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:50:07,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:50:07,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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 21:50:07,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-04-27 21:50:07,039 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 12 [2022-04-27 21:50:07,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:50:07,040 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-04-27 21:50:07,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:50:07,040 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-27 21:50:07,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 21:50:07,041 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:50:07,041 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:50:07,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:50:07,041 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:50:07,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:50:07,042 INFO L85 PathProgramCache]: Analyzing trace with hash 795142128, now seen corresponding path program 1 times [2022-04-27 21:50:07,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:50:07,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239343317] [2022-04-27 21:50:07,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:50:07,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:50:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:50:07,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:50:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:50:07,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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|) (= |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) (= 51 (select .cse1 3)) (= 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] {140#true} is VALID [2022-04-27 21:50:07,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {140#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {140#true} is VALID [2022-04-27 21:50:07,120 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {140#true} {140#true} [90] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {140#true} is VALID [2022-04-27 21:50:07,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {140#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:50:07,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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|) (= |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) (= 51 (select .cse1 3)) (= 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] {140#true} is VALID [2022-04-27 21:50:07,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {140#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {140#true} is VALID [2022-04-27 21:50:07,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {140#true} {140#true} [90] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {140#true} is VALID [2022-04-27 21:50:07,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {140#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {140#true} is VALID [2022-04-27 21:50:07,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {140#true} [67] mainENTRY-->L25-2: Formula: (and (= v_main_~y~0_1 1) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {145#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 21:50:07,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {145#(= (+ (- 1) main_~y~0) 0)} [70] L25-2-->L18-1: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|} AuxVars[] AssignedVars[] {145#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 21:50:07,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {145#(= (+ (- 1) main_~y~0) 0)} [73] L18-1-->L18-3: Formula: (= |v_main_#t~nondet5_3| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {145#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 21:50:07,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {145#(= (+ (- 1) main_~y~0) 0)} [71] L18-3-->L33: Formula: (= (mod v_main_~y~0_2 4294967296) 0) InVars {main_~y~0=v_main_~y~0_2} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[] {141#false} is VALID [2022-04-27 21:50:07,125 INFO L272 TraceCheckUtils]: 9: Hoare triple {141#false} [75] L33-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (mod (mod v_main_~x~0_13 4294967296) 3) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {141#false} is VALID [2022-04-27 21:50:07,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {141#false} [79] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {141#false} is VALID [2022-04-27 21:50:07,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {141#false} [83] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {141#false} is VALID [2022-04-27 21:50:07,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {141#false} [87] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {141#false} is VALID [2022-04-27 21:50:07,126 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 21:50:07,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:50:07,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239343317] [2022-04-27 21:50:07,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239343317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:50:07,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:50:07,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 21:50:07,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676764757] [2022-04-27 21:50:07,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:50:07,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 13 [2022-04-27 21:50:07,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:50:07,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 21:50:07,145 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 21:50:07,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 21:50:07,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:50:07,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 21:50:07,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 21:50:07,147 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 21:50:11,373 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:50:15,713 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:50:20,073 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 21:50:20,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:50:20,259 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-27 21:50:20,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 21:50:20,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 13 [2022-04-27 21:50:20,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:50:20,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 21:50:20,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-04-27 21:50:20,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 21:50:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-04-27 21:50:20,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2022-04-27 21:50:20,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:50:20,305 INFO L225 Difference]: With dead ends: 28 [2022-04-27 21:50:20,305 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 21:50:20,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:50:20,307 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:50:20,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 27 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 3 Unknown, 0 Unchecked, 6.0s Time] [2022-04-27 21:50:20,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 21:50:20,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2022-04-27 21:50:20,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:50:20,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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 21:50:20,311 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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 21:50:20,311 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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 21:50:20,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:50:20,313 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-27 21:50:20,313 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-27 21:50:20,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:50:20,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:50:20,314 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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 22 states. [2022-04-27 21:50:20,314 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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 22 states. [2022-04-27 21:50:20,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:50:20,316 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-27 21:50:20,316 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-27 21:50:20,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:50:20,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:50:20,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:50:20,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:50:20,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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 21:50:20,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-27 21:50:20,318 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2022-04-27 21:50:20,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:50:20,318 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-27 21:50:20,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 21:50:20,319 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-27 21:50:20,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 21:50:20,319 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:50:20,319 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:50:20,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:50:20,320 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:50:20,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:50:20,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1068283583, now seen corresponding path program 1 times [2022-04-27 21:50:20,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:50:20,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159517626] [2022-04-27 21:50:20,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:50:20,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:50:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:50:20,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:50:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:50:20,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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|) (= |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) (= 51 (select .cse1 3)) (= 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] {260#true} is VALID [2022-04-27 21:50:20,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {260#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260#true} is VALID [2022-04-27 21:50:20,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {260#true} {260#true} [90] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260#true} is VALID [2022-04-27 21:50:20,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {260#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:50:20,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] 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|) (= |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) (= 51 (select .cse1 3)) (= 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] {260#true} is VALID [2022-04-27 21:50:20,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {260#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260#true} is VALID [2022-04-27 21:50:20,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {260#true} {260#true} [90] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260#true} is VALID [2022-04-27 21:50:20,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {260#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260#true} is VALID [2022-04-27 21:50:20,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {260#true} [67] mainENTRY-->L25-2: Formula: (and (= v_main_~y~0_1 1) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {265#(and (<= main_~x~0 2147483647) (or (<= 0 (+ main_~x~0 2147483648)) (< 1431655764 (+ (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 1431655765)))))} is VALID [2022-04-27 21:50:20,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {265#(and (<= main_~x~0 2147483647) (or (<= 0 (+ main_~x~0 2147483648)) (< 1431655764 (+ (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 1431655765)))))} [70] L25-2-->L18-1: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|} AuxVars[] AssignedVars[] {265#(and (<= main_~x~0 2147483647) (or (<= 0 (+ main_~x~0 2147483648)) (< 1431655764 (+ (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 1431655765)))))} is VALID [2022-04-27 21:50:20,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {265#(and (<= main_~x~0 2147483647) (or (<= 0 (+ main_~x~0 2147483648)) (< 1431655764 (+ (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 1431655765)))))} [74] L18-1-->L19: Formula: (not (= |v_main_#t~nondet5_5| 0)) InVars {main_#t~nondet5=|v_main_#t~nondet5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {265#(and (<= main_~x~0 2147483647) (or (<= 0 (+ main_~x~0 2147483648)) (< 1431655764 (+ (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 1431655765)))))} is VALID [2022-04-27 21:50:22,897 WARN L290 TraceCheckUtils]: 8: Hoare triple {265#(and (<= main_~x~0 2147483647) (or (<= 0 (+ main_~x~0 2147483648)) (< 1431655764 (+ (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 1431655765)))))} [77] L19-->L25-2: Formula: (and (= v_main_~x~0_3 (+ v_main_~x~0_4 2)) (= v_main_~y~0_4 0) (= (mod (mod (mod v_main_~x~0_4 4294967296) 3) 4294967296) 1)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {266#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 4294967296) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) 3)))} is UNKNOWN [2022-04-27 21:50:22,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {266#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 4294967296) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) 3)))} [70] L25-2-->L18-1: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|} AuxVars[] AssignedVars[] {266#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 4294967296) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) 3)))} is VALID [2022-04-27 21:50:22,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {266#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 4294967296) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) 3)))} [73] L18-1-->L18-3: Formula: (= |v_main_#t~nondet5_3| 0) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {266#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 4294967296) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) 3)))} is VALID [2022-04-27 21:50:22,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {266#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 4294967296) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) 3)))} [71] L18-3-->L33: Formula: (= (mod v_main_~y~0_2 4294967296) 0) InVars {main_~y~0=v_main_~y~0_2} OutVars{main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[] {266#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 4294967296) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) 3)))} is VALID [2022-04-27 21:50:22,907 INFO L272 TraceCheckUtils]: 12: Hoare triple {266#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 4294967296) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) 3)))} [75] L33-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (mod (mod v_main_~x~0_13 4294967296) 3) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {267#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:50:22,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {267#(not (= |__VERIFIER_assert_#in~cond| 0))} [79] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {268#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:50:22,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {268#(not (= __VERIFIER_assert_~cond 0))} [83] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {261#false} is VALID [2022-04-27 21:50:22,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {261#false} [87] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {261#false} is VALID [2022-04-27 21:50:22,909 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 21:50:22,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:50:22,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159517626] [2022-04-27 21:50:22,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159517626] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:50:22,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307203821] [2022-04-27 21:50:22,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:50:22,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:50:22,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:50:22,914 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 21:50:22,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process