/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.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 22:42:31,317 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 22:42:31,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 22:42:31,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 22:42:31,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 22:42:31,370 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 22:42:31,370 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 22:42:31,371 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 22:42:31,372 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 22:42:31,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 22:42:31,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 22:42:31,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 22:42:31,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 22:42:31,375 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 22:42:31,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 22:42:31,376 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 22:42:31,376 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 22:42:31,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 22:42:31,378 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 22:42:31,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 22:42:31,380 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 22:42:31,380 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 22:42:31,381 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 22:42:31,382 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 22:42:31,382 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 22:42:31,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 22:42:31,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 22:42:31,384 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 22:42:31,385 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 22:42:31,385 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 22:42:31,386 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 22:42:31,386 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 22:42:31,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 22:42:31,387 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 22:42:31,387 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 22:42:31,388 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 22:42:31,388 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 22:42:31,388 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 22:42:31,389 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 22:42:31,389 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 22:42:31,389 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 22:42:31,392 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 22:42:31,393 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 22:42:31,411 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 22:42:31,412 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 22:42:31,412 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 22:42:31,412 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 22:42:31,413 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 22:42:31,413 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 22:42:31,413 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 22:42:31,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 22:42:31,413 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 22:42:31,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 22:42:31,413 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 22:42:31,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 22:42:31,413 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 22:42:31,413 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 22:42:31,413 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 22:42:31,414 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 22:42:31,414 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 22:42:31,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 22:42:31,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 22:42:31,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:42:31,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 22:42:31,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 22:42:31,414 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 22:42:31,414 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 22:42:31,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 22:42:31,414 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 22:42:31,414 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 22:42:31,415 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 22:42:31,415 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 22:42:31,415 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-07 22:42:31,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 22:42:31,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 22:42:31,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 22:42:31,626 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 22:42:31,626 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 22:42:31,628 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+cfa-reducer.c [2022-04-07 22:42:31,675 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cf3d6a32/cb54d3ed8c42407bba8dcc093473a8f8/FLAG73ce465c5 [2022-04-07 22:42:32,071 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 22:42:32,071 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+cfa-reducer.c [2022-04-07 22:42:32,075 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cf3d6a32/cb54d3ed8c42407bba8dcc093473a8f8/FLAG73ce465c5 [2022-04-07 22:42:32,083 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cf3d6a32/cb54d3ed8c42407bba8dcc093473a8f8 [2022-04-07 22:42:32,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 22:42:32,086 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 22:42:32,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 22:42:32,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 22:42:32,102 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 22:42:32,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:42:32" (1/1) ... [2022-04-07 22:42:32,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41cafe60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:42:32, skipping insertion in model container [2022-04-07 22:42:32,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:42:32" (1/1) ... [2022-04-07 22:42:32,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 22:42:32,121 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 22:42:32,255 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.v+cfa-reducer.c[1250,1263] [2022-04-07 22:42:32,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:42:32,267 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 22:42:32,288 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.v+cfa-reducer.c[1250,1263] [2022-04-07 22:42:32,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:42:32,302 INFO L208 MainTranslator]: Completed translation [2022-04-07 22:42:32,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:42:32 WrapperNode [2022-04-07 22:42:32,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 22:42:32,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 22:42:32,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 22:42:32,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 22:42:32,311 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:42:32" (1/1) ... [2022-04-07 22:42:32,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:42:32" (1/1) ... [2022-04-07 22:42:32,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:42:32" (1/1) ... [2022-04-07 22:42:32,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:42:32" (1/1) ... [2022-04-07 22:42:32,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:42:32" (1/1) ... [2022-04-07 22:42:32,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:42:32" (1/1) ... [2022-04-07 22:42:32,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:42:32" (1/1) ... [2022-04-07 22:42:32,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 22:42:32,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 22:42:32,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 22:42:32,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 22:42:32,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:42:32" (1/1) ... [2022-04-07 22:42:32,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:42:32,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:42:32,358 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-07 22:42:32,387 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-07 22:42:32,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 22:42:32,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 22:42:32,400 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 22:42:32,400 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 22:42:32,401 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 22:42:32,401 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 22:42:32,401 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 22:42:32,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 22:42:32,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 22:42:32,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 22:42:32,403 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 22:42:32,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 22:42:32,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 22:42:32,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 22:42:32,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 22:42:32,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 22:42:32,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 22:42:32,452 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 22:42:32,454 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 22:42:36,937 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 22:42:36,941 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 22:42:36,941 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-07 22:42:36,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:42:36 BoogieIcfgContainer [2022-04-07 22:42:36,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 22:42:36,943 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 22:42:36,943 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 22:42:36,946 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 22:42:36,948 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:42:36" (1/1) ... [2022-04-07 22:42:36,949 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 22:42:36,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:42:36 BasicIcfg [2022-04-07 22:42:36,976 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 22:42:36,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 22:42:36,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 22:42:36,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 22:42:36,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 10:42:32" (1/4) ... [2022-04-07 22:42:36,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dced077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:42:36, skipping insertion in model container [2022-04-07 22:42:36,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:42:32" (2/4) ... [2022-04-07 22:42:36,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dced077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:42:36, skipping insertion in model container [2022-04-07 22:42:36,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:42:36" (3/4) ... [2022-04-07 22:42:36,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dced077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:42:36, skipping insertion in model container [2022-04-07 22:42:36,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:42:36" (4/4) ... [2022-04-07 22:42:36,981 INFO L111 eAbstractionObserver]: Analyzing ICFG mod3.c.v+cfa-reducer.cqvasr [2022-04-07 22:42:36,984 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 22:42:36,984 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 22:42:37,021 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 22:42:37,026 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 22:42:37,027 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 22:42:37,045 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 22:42:37,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 22:42:37,050 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:42:37,051 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:42:37,051 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:42:37,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:42:37,058 INFO L85 PathProgramCache]: Analyzing trace with hash -963747291, now seen corresponding path program 1 times [2022-04-07 22:42:37,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:42:37,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693112542] [2022-04-07 22:42:37,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:42:37,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:42:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:42:37,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:42:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:42:37,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_107~0)| ~__return_107~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__return_107~0_2 0) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= 0 v_~__return_main~0_3) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_107~0=v_~__return_107~0_2, #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[~__return_main~0, ~__return_107~0, #NULL.offset, #NULL.base] {22#true} is VALID [2022-04-07 22:42:37,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-07 22:42:37,237 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-07 22:42:37,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_107~0)| ~__return_107~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:42:37,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_107~0)| ~__return_107~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__return_107~0_2 0) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= 0 v_~__return_main~0_3) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_107~0=v_~__return_107~0_2, #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[~__return_main~0, ~__return_107~0, #NULL.offset, #NULL.base] {22#true} is VALID [2022-04-07 22:42:37,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-07 22:42:37,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-07 22:42:37,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-07 22:42:37,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} [50] mainENTRY-->L47: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__x~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__y~0_1 1)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {27#(= (+ (- 1) main_~main__y~0) 0)} is VALID [2022-04-07 22:42:37,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#(= (+ (- 1) main_~main__y~0) 0)} [52] L47-->L16: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {27#(= (+ (- 1) main_~main__y~0) 0)} is VALID [2022-04-07 22:42:37,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#(= (+ (- 1) main_~main__y~0) 0)} [54] L16-->L54: Formula: (= v_main_~main____CPAchecker_TMP_0~0_5 0) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[] {27#(= (+ (- 1) main_~main__y~0) 0)} is VALID [2022-04-07 22:42:37,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#(= (+ (- 1) main_~main__y~0) 0)} [57] L54-->L61: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_2) (= (mod v_main_~main__y~0_7 4294967296) 0) (= v_main_~__tmp_1~0_1 (ite (= (mod (mod (mod v_main_~main__x~0_12 4294967296) 3) 4294967296) 0) 1 0))) InVars {main_~main__x~0=v_main_~main__x~0_12, main_~main__y~0=v_main_~main__y~0_7} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_2, main_~main__x~0=v_main_~main__x~0_12, main_~main__y~0=v_main_~main__y~0_7, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {23#false} is VALID [2022-04-07 22:42:37,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} [61] L61-->L63: Formula: (= v_main_~__VERIFIER_assert__cond~0_4 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-07 22:42:37,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} [66] L63-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-07 22:42:37,249 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-07 22:42:37,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:42:37,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693112542] [2022-04-07 22:42:37,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693112542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:42:37,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:42:37,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 22:42:37,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045399466] [2022-04-07 22:42:37,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:42:37,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 22:42:37,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:42:37,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:42:37,281 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-07 22:42:37,281 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 22:42:37,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:42:37,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 22:42:37,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 22:42:37,310 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:42:41,531 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-07 22:42:45,877 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-07 22:42:48,078 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-07 22:42:50,250 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-07 22:42:50,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:42:50,464 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-07 22:42:50,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 22:42:50,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 22:42:50,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:42:50,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:42:50,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-07 22:42:50,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:42:50,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-07 22:42:50,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2022-04-07 22:42:50,534 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-07 22:42:50,539 INFO L225 Difference]: With dead ends: 36 [2022-04-07 22:42:50,539 INFO L226 Difference]: Without dead ends: 20 [2022-04-07 22:42:50,541 INFO L912 BasicCegarLoop]: 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-07 22:42:50,543 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 31 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-04-07 22:42:50,544 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 31 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 4 Unknown, 0 Unchecked, 8.1s Time] [2022-04-07 22:42:50,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-07 22:42:50,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2022-04-07 22:42:50,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:42:50,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:42:50,564 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:42:50,564 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:42:50,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:42:50,566 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-04-07 22:42:50,566 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-04-07 22:42:50,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:42:50,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:42:50,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-07 22:42:50,567 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-07 22:42:50,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:42:50,569 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-04-07 22:42:50,570 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-04-07 22:42:50,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:42:50,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:42:50,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:42:50,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:42:50,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:42:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-04-07 22:42:50,572 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 11 [2022-04-07 22:42:50,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:42:50,573 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-04-07 22:42:50,573 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:42:50,573 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-07 22:42:50,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 22:42:50,574 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:42:50,574 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:42:50,574 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 22:42:50,574 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:42:50,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:42:50,575 INFO L85 PathProgramCache]: Analyzing trace with hash -92546851, now seen corresponding path program 1 times [2022-04-07 22:42:50,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:42:50,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906473302] [2022-04-07 22:42:50,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:42:50,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:42:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:42:50,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:42:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:42:50,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {146#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_107~0)| ~__return_107~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__return_107~0_2 0) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= 0 v_~__return_main~0_3) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_107~0=v_~__return_107~0_2, #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[~__return_main~0, ~__return_107~0, #NULL.offset, #NULL.base] {138#true} is VALID [2022-04-07 22:42:50,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {138#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-07 22:42:50,917 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {138#true} {138#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-07 22:42:50,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {138#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_107~0)| ~__return_107~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:42:50,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_107~0)| ~__return_107~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__return_107~0_2 0) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= 0 v_~__return_main~0_3) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_107~0=v_~__return_107~0_2, #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[~__return_main~0, ~__return_107~0, #NULL.offset, #NULL.base] {138#true} is VALID [2022-04-07 22:42:50,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {138#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-07 22:42:50,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138#true} {138#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-07 22:42:50,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {138#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-07 22:42:50,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {138#true} [50] mainENTRY-->L47: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__x~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__y~0_1 1)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {143#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-07 22:42:50,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {143#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} [52] L47-->L16: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {143#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-07 22:42:50,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {143#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} [53] L16-->L18: Formula: (not (= v_main_~main____CPAchecker_TMP_0~0_4 0)) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} AuxVars[] AssignedVars[] {143#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-07 22:42:53,033 WARN L290 TraceCheckUtils]: 8: Hoare triple {143#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} [55] L18-->L47: Formula: (and (= (+ 2 v_main_~main__x~0_3) v_main_~main__x~0_2) (= (mod (mod (mod v_main_~main__x~0_3 4294967296) 3) 4294967296) 1) (= 0 v_main_~main__y~0_3)) InVars {main_~main__x~0=v_main_~main__x~0_3} OutVars{main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_3} AuxVars[] AssignedVars[main_~main__x~0, main_~main__y~0] {144#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-07 22:42:53,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {144#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [52] L47-->L16: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {144#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 22:42:53,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {144#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [54] L16-->L54: Formula: (= v_main_~main____CPAchecker_TMP_0~0_5 0) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[] {144#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 22:42:53,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {144#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [57] L54-->L61: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_2) (= (mod v_main_~main__y~0_7 4294967296) 0) (= v_main_~__tmp_1~0_1 (ite (= (mod (mod (mod v_main_~main__x~0_12 4294967296) 3) 4294967296) 0) 1 0))) InVars {main_~main__x~0=v_main_~main__x~0_12, main_~main__y~0=v_main_~main__y~0_7} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_2, main_~main__x~0=v_main_~main__x~0_12, main_~main__y~0=v_main_~main__y~0_7, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {145#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-07 22:42:53,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {145#(not (= main_~__VERIFIER_assert__cond~0 0))} [61] L61-->L63: Formula: (= v_main_~__VERIFIER_assert__cond~0_4 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} AuxVars[] AssignedVars[] {139#false} is VALID [2022-04-07 22:42:53,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {139#false} [66] L63-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {139#false} is VALID [2022-04-07 22:42:53,044 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-07 22:42:53,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:42:53,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906473302] [2022-04-07 22:42:53,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906473302] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:42:53,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932046276] [2022-04-07 22:42:53,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:42:53,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:42:53,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:42:53,046 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-07 22:42:53,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process