/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/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/lcm2_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 22:36:49,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 22:36:49,282 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 22:36:49,312 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 22:36:49,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 22:36:49,313 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 22:36:49,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 22:36:49,315 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 22:36:49,321 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 22:36:49,325 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 22:36:49,326 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 22:36:49,327 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 22:36:49,327 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 22:36:49,329 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 22:36:49,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 22:36:49,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 22:36:49,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 22:36:49,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 22:36:49,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 22:36:49,339 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 22:36:49,340 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 22:36:49,341 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 22:36:49,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 22:36:49,344 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 22:36:49,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 22:36:49,350 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 22:36:49,350 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 22:36:49,350 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 22:36:49,351 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 22:36:49,351 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 22:36:49,352 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 22:36:49,352 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 22:36:49,353 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 22:36:49,354 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 22:36:49,354 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 22:36:49,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 22:36:49,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 22:36:49,355 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 22:36:49,355 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 22:36:49,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 22:36:49,356 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 22:36:49,357 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 22:36:49,358 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 22:36:49,367 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 22:36:49,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 22:36:49,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 22:36:49,368 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 22:36:49,368 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 22:36:49,368 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 22:36:49,369 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 22:36:49,369 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 22:36:49,369 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 22:36:49,369 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 22:36:49,369 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 22:36:49,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 22:36:49,370 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 22:36:49,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 22:36:49,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 22:36:49,370 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 22:36:49,370 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 22:36:49,370 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 22:36:49,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 22:36:49,370 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 22:36:49,370 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 22:36:49,371 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 22:36:49,371 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-14 22:36:49,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 22:36:49,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 22:36:49,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 22:36:49,567 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 22:36:49,568 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 22:36:49,569 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/lcm2_valuebound50.c [2022-04-14 22:36:49,614 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c3028296/e0baaac11a95461994f5dfbe45d0da7f/FLAG2baa39209 [2022-04-14 22:36:49,984 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 22:36:49,984 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm2_valuebound50.c [2022-04-14 22:36:49,988 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c3028296/e0baaac11a95461994f5dfbe45d0da7f/FLAG2baa39209 [2022-04-14 22:36:49,998 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c3028296/e0baaac11a95461994f5dfbe45d0da7f [2022-04-14 22:36:49,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 22:36:50,001 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 22:36:50,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 22:36:50,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 22:36:50,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 22:36:50,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 10:36:49" (1/1) ... [2022-04-14 22:36:50,009 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ba95f7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:50, skipping insertion in model container [2022-04-14 22:36:50,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 10:36:49" (1/1) ... [2022-04-14 22:36:50,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 22:36:50,023 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 22:36:50,188 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm2_valuebound50.c[537,550] [2022-04-14 22:36:50,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 22:36:50,216 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 22:36:50,227 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm2_valuebound50.c[537,550] [2022-04-14 22:36:50,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 22:36:50,244 INFO L208 MainTranslator]: Completed translation [2022-04-14 22:36:50,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:50 WrapperNode [2022-04-14 22:36:50,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 22:36:50,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 22:36:50,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 22:36:50,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 22:36:50,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:50" (1/1) ... [2022-04-14 22:36:50,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:50" (1/1) ... [2022-04-14 22:36:50,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:50" (1/1) ... [2022-04-14 22:36:50,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:50" (1/1) ... [2022-04-14 22:36:50,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:50" (1/1) ... [2022-04-14 22:36:50,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:50" (1/1) ... [2022-04-14 22:36:50,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:50" (1/1) ... [2022-04-14 22:36:50,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 22:36:50,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 22:36:50,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 22:36:50,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 22:36:50,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:50" (1/1) ... [2022-04-14 22:36:50,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 22:36:50,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 22:36:50,301 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-14 22:36:50,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-14 22:36:50,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 22:36:50,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 22:36:50,342 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 22:36:50,343 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 22:36:50,343 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 22:36:50,343 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 22:36:50,343 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 22:36:50,343 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 22:36:50,343 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 22:36:50,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 22:36:50,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-14 22:36:50,343 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 22:36:50,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 22:36:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 22:36:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 22:36:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 22:36:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 22:36:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 22:36:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 22:36:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 22:36:50,383 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 22:36:50,384 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 22:36:50,542 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 22:36:50,547 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 22:36:50,547 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 22:36:50,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 10:36:50 BoogieIcfgContainer [2022-04-14 22:36:50,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 22:36:50,548 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 22:36:50,548 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 22:36:50,552 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 22:36:50,554 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 10:36:50" (1/1) ... [2022-04-14 22:36:50,555 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 22:36:50,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 10:36:50 BasicIcfg [2022-04-14 22:36:50,592 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 22:36:50,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 22:36:50,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 22:36:50,595 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 22:36:50,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 10:36:49" (1/4) ... [2022-04-14 22:36:50,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ca0048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 10:36:50, skipping insertion in model container [2022-04-14 22:36:50,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:50" (2/4) ... [2022-04-14 22:36:50,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ca0048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 10:36:50, skipping insertion in model container [2022-04-14 22:36:50,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 10:36:50" (3/4) ... [2022-04-14 22:36:50,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ca0048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 10:36:50, skipping insertion in model container [2022-04-14 22:36:50,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 10:36:50" (4/4) ... [2022-04-14 22:36:50,597 INFO L111 eAbstractionObserver]: Analyzing ICFG lcm2_valuebound50.cJordan [2022-04-14 22:36:50,600 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 22:36:50,600 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 22:36:50,633 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 22:36:50,639 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 22:36:50,640 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 22:36:50,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 22:36:50,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-14 22:36:50,658 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 22:36:50,659 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 22:36:50,659 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 22:36:50,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 22:36:50,663 INFO L85 PathProgramCache]: Analyzing trace with hash -419271626, now seen corresponding path program 1 times [2022-04-14 22:36:50,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 22:36:50,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691652687] [2022-04-14 22:36:50,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 22:36:50,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 22:36:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:36:50,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 22:36:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:36:50,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [84] 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)) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select .cse1 2) 109) (= (select |v_#valid_1| 1) 1) (= (select .cse1 3) 50) (= 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] {37#true} is VALID [2022-04-14 22:36:50,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [87] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-14 22:36:50,857 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-14 22:36:50,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 22:36:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:36:50,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-14 22:36:50,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [92] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} [118] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~a~0_10 4294967296) 50) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {38#false} is VALID [2022-04-14 22:36:50,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-14 22:36:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:36:50,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-14 22:36:50,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [92] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} [119] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~b~0_9 4294967296) 50) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-14 22:36:50,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-14 22:36:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:36:50,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-14 22:36:50,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [92] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} [120] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 (mod v_main_~a~0_11 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {38#false} is VALID [2022-04-14 22:36:50,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-14 22:36:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:36:50,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-14 22:36:50,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [92] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} [121] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 (mod v_main_~b~0_10 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-14 22:36:50,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-14 22:36:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:36:50,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-14 22:36:50,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [92] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} [122] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~a~0_12 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_5|) InVars {main_~a~0=v_main_~a~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_5|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {38#false} is VALID [2022-04-14 22:36:50,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-14 22:36:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:36:50,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-14 22:36:50,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [92] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} [123] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_6| (ite (<= (mod v_main_~b~0_11 4294967296) 65535) 1 0)) InVars {main_~b~0=v_main_~b~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_6|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-14 22:36:50,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} [82] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 22:36:50,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [84] 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)) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select .cse1 2) 109) (= (select |v_#valid_1| 1) 1) (= (select .cse1 3) 50) (= 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] {37#true} is VALID [2022-04-14 22:36:50,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} [87] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-14 22:36:50,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-14 22:36:50,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} [83] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-14 22:36:50,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} [86] mainENTRY-->L23: Formula: (= v_main_~a~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_4, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_1, main_~u~0=v_main_~u~0_4, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {37#true} is VALID [2022-04-14 22:36:50,905 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} [88] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~a~0_10 4294967296) 50) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {37#true} is VALID [2022-04-14 22:36:50,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-14 22:36:50,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} [92] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,906 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} [118] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~a~0_10 4294967296) 50) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {38#false} is VALID [2022-04-14 22:36:50,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#false} [89] L23-1-->L25: Formula: (= v_main_~b~0_3 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~b~0=v_main_~b~0_3} AuxVars[] AssignedVars[main_#t~nondet5, main_~b~0] {38#false} is VALID [2022-04-14 22:36:50,906 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#false} [91] L25-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~b~0_9 4294967296) 50) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {37#true} is VALID [2022-04-14 22:36:50,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-14 22:36:50,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} [92] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,907 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38#false} {38#false} [119] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~b~0_9 4294967296) 50) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-14 22:36:50,907 INFO L272 TraceCheckUtils]: 17: Hoare triple {38#false} [94] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 (mod v_main_~a~0_11 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {37#true} is VALID [2022-04-14 22:36:50,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-14 22:36:50,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} [92] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,908 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38#false} {38#false} [120] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 (mod v_main_~a~0_11 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {38#false} is VALID [2022-04-14 22:36:50,909 INFO L272 TraceCheckUtils]: 22: Hoare triple {38#false} [96] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 (mod v_main_~b~0_10 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {37#true} is VALID [2022-04-14 22:36:50,909 INFO L290 TraceCheckUtils]: 23: Hoare triple {37#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-14 22:36:50,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {37#true} [92] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#false} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,910 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {38#false} {38#false} [121] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 (mod v_main_~b~0_10 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-14 22:36:50,910 INFO L272 TraceCheckUtils]: 27: Hoare triple {38#false} [97] L27-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~a~0_12 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_5|) InVars {main_~a~0=v_main_~a~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_5|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {37#true} is VALID [2022-04-14 22:36:50,910 INFO L290 TraceCheckUtils]: 28: Hoare triple {37#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-14 22:36:50,910 INFO L290 TraceCheckUtils]: 29: Hoare triple {37#true} [92] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,911 INFO L290 TraceCheckUtils]: 30: Hoare triple {38#false} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,911 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {38#false} {38#false} [122] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~a~0_12 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_5|) InVars {main_~a~0=v_main_~a~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_5|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {38#false} is VALID [2022-04-14 22:36:50,911 INFO L272 TraceCheckUtils]: 32: Hoare triple {38#false} [98] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_6| (ite (<= (mod v_main_~b~0_11 4294967296) 65535) 1 0)) InVars {main_~b~0=v_main_~b~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_6|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {37#true} is VALID [2022-04-14 22:36:50,911 INFO L290 TraceCheckUtils]: 33: Hoare triple {37#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-14 22:36:50,912 INFO L290 TraceCheckUtils]: 34: Hoare triple {37#true} [92] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,912 INFO L290 TraceCheckUtils]: 35: Hoare triple {38#false} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,912 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {38#false} {38#false} [123] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_6| (ite (<= (mod v_main_~b~0_11 4294967296) 65535) 1 0)) InVars {main_~b~0=v_main_~b~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_6|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-14 22:36:50,912 INFO L290 TraceCheckUtils]: 37: Hoare triple {38#false} [99] L30-->L43-2: Formula: (and (= v_main_~a~0_8 v_main_~v~0_6) (= v_main_~b~0_7 v_main_~y~0_7) (= v_main_~b~0_7 v_main_~u~0_6) (= v_main_~a~0_8 v_main_~x~0_7)) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_8} OutVars{main_~v~0=v_main_~v~0_6, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_7, main_~u~0=v_main_~u~0_6, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~v~0, main_~x~0, main_~y~0, main_~u~0] {38#false} is VALID [2022-04-14 22:36:50,912 INFO L290 TraceCheckUtils]: 38: Hoare triple {38#false} [100] L43-2-->L37-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,913 INFO L272 TraceCheckUtils]: 39: Hoare triple {38#false} [103] L37-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod (* (* 2 v_main_~a~0_14) v_main_~b~0_13) 4294967296) (mod (+ (* v_main_~x~0_11 v_main_~u~0_9) (* v_main_~y~0_11 v_main_~v~0_9)) 4294967296)) 1 0)) InVars {main_~v~0=v_main_~v~0_9, main_~x~0=v_main_~x~0_11, main_~y~0=v_main_~y~0_11, main_~b~0=v_main_~b~0_13, main_~u~0=v_main_~u~0_9, main_~a~0=v_main_~a~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {38#false} is VALID [2022-04-14 22:36:50,913 INFO L290 TraceCheckUtils]: 40: Hoare triple {38#false} [106] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {38#false} is VALID [2022-04-14 22:36:50,913 INFO L290 TraceCheckUtils]: 41: Hoare triple {38#false} [110] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,913 INFO L290 TraceCheckUtils]: 42: Hoare triple {38#false} [114] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 22:36:50,914 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-14 22:36:50,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 22:36:50,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691652687] [2022-04-14 22:36:50,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691652687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 22:36:50,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 22:36:50,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 22:36:50,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083571585] [2022-04-14 22:36:50,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 22:36:50,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-04-14 22:36:50,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 22:36:50,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 22:36:50,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 22:36:50,970 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 22:36:50,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 22:36:50,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 22:36:50,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 22:36:50,990 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 22:36:51,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:36:51,113 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-14 22:36:51,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 22:36:51,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-04-14 22:36:51,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 22:36:51,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 22:36:51,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-04-14 22:36:51,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 22:36:51,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-04-14 22:36:51,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2022-04-14 22:36:51,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 22:36:51,168 INFO L225 Difference]: With dead ends: 34 [2022-04-14 22:36:51,168 INFO L226 Difference]: Without dead ends: 29 [2022-04-14 22:36:51,169 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 22:36:51,172 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 22:36:51,172 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 36 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 22:36:51,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-14 22:36:51,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-14 22:36:51,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 22:36:51,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 22:36:51,191 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 22:36:51,192 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 22:36:51,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:36:51,195 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-14 22:36:51,195 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-14 22:36:51,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 22:36:51,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 22:36:51,196 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 29 states. [2022-04-14 22:36:51,197 INFO L87 Difference]: Start difference. First operand has 29 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 29 states. [2022-04-14 22:36:51,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:36:51,205 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-14 22:36:51,205 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-14 22:36:51,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 22:36:51,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 22:36:51,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 22:36:51,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 22:36:51,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 22:36:51,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-04-14 22:36:51,213 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 43 [2022-04-14 22:36:51,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 22:36:51,213 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-04-14 22:36:51,213 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 22:36:51,214 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-14 22:36:51,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-14 22:36:51,216 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 22:36:51,216 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 22:36:51,217 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 22:36:51,217 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 22:36:51,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 22:36:51,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1223303911, now seen corresponding path program 1 times [2022-04-14 22:36:51,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 22:36:51,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283362127] [2022-04-14 22:36:51,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 22:36:51,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 22:36:51,261 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 22:36:51,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1280166698] [2022-04-14 22:36:51,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 22:36:51,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 22:36:51,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 22:36:51,263 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 22:36:51,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-14 22:36:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:36:51,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-14 22:36:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:36:51,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 22:36:51,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {190#true} [82] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {190#true} is VALID [2022-04-14 22:36:51,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {190#true} [84] 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)) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select .cse1 2) 109) (= (select |v_#valid_1| 1) 1) (= (select .cse1 3) 50) (= 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] {190#true} is VALID [2022-04-14 22:36:51,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {190#true} [87] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {190#true} is VALID [2022-04-14 22:36:51,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {190#true} {190#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {190#true} is VALID [2022-04-14 22:36:51,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {190#true} [83] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {190#true} is VALID [2022-04-14 22:36:51,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {190#true} [86] mainENTRY-->L23: Formula: (= v_main_~a~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_4, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_1, main_~u~0=v_main_~u~0_4, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {190#true} is VALID [2022-04-14 22:36:51,738 INFO L272 TraceCheckUtils]: 6: Hoare triple {190#true} [88] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~a~0_10 4294967296) 50) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {190#true} is VALID [2022-04-14 22:36:51,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {190#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {190#true} is VALID [2022-04-14 22:36:51,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {190#true} [93] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {190#true} is VALID [2022-04-14 22:36:51,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {190#true} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {190#true} is VALID [2022-04-14 22:36:51,739 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {190#true} {190#true} [118] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~a~0_10 4294967296) 50) 1 0)) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {190#true} is VALID [2022-04-14 22:36:51,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {190#true} [89] L23-1-->L25: Formula: (= v_main_~b~0_3 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~b~0=v_main_~b~0_3} AuxVars[] AssignedVars[main_#t~nondet5, main_~b~0] {190#true} is VALID [2022-04-14 22:36:51,740 INFO L272 TraceCheckUtils]: 12: Hoare triple {190#true} [91] L25-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~b~0_9 4294967296) 50) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {190#true} is VALID [2022-04-14 22:36:51,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {190#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {190#true} is VALID [2022-04-14 22:36:51,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {190#true} [93] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {190#true} is VALID [2022-04-14 22:36:51,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {190#true} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {190#true} is VALID [2022-04-14 22:36:51,741 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {190#true} {190#true} [119] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~b~0_9 4294967296) 50) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {190#true} is VALID [2022-04-14 22:36:51,742 INFO L272 TraceCheckUtils]: 17: Hoare triple {190#true} [94] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 (mod v_main_~a~0_11 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {190#true} is VALID [2022-04-14 22:36:51,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {190#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {190#true} is VALID [2022-04-14 22:36:51,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {190#true} [93] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {190#true} is VALID [2022-04-14 22:36:51,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {190#true} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {190#true} is VALID [2022-04-14 22:36:51,743 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {190#true} {190#true} [120] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 (mod v_main_~a~0_11 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {190#true} is VALID [2022-04-14 22:36:51,743 INFO L272 TraceCheckUtils]: 22: Hoare triple {190#true} [96] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 (mod v_main_~b~0_10 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {190#true} is VALID [2022-04-14 22:36:51,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {190#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {190#true} is VALID [2022-04-14 22:36:51,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {190#true} [93] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {190#true} is VALID [2022-04-14 22:36:51,744 INFO L290 TraceCheckUtils]: 25: Hoare triple {190#true} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {190#true} is VALID [2022-04-14 22:36:51,744 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {190#true} {190#true} [121] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 (mod v_main_~b~0_10 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {190#true} is VALID [2022-04-14 22:36:51,744 INFO L272 TraceCheckUtils]: 27: Hoare triple {190#true} [97] L27-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~a~0_12 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_5|) InVars {main_~a~0=v_main_~a~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_5|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {190#true} is VALID [2022-04-14 22:36:51,744 INFO L290 TraceCheckUtils]: 28: Hoare triple {190#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {190#true} is VALID [2022-04-14 22:36:51,745 INFO L290 TraceCheckUtils]: 29: Hoare triple {190#true} [93] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {190#true} is VALID [2022-04-14 22:36:51,746 INFO L290 TraceCheckUtils]: 30: Hoare triple {190#true} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {190#true} is VALID [2022-04-14 22:36:51,747 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {190#true} {190#true} [122] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~a~0_12 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_5|) InVars {main_~a~0=v_main_~a~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_5|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {190#true} is VALID [2022-04-14 22:36:51,747 INFO L272 TraceCheckUtils]: 32: Hoare triple {190#true} [98] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_6| (ite (<= (mod v_main_~b~0_11 4294967296) 65535) 1 0)) InVars {main_~b~0=v_main_~b~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_6|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {190#true} is VALID [2022-04-14 22:36:51,747 INFO L290 TraceCheckUtils]: 33: Hoare triple {190#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {190#true} is VALID [2022-04-14 22:36:51,747 INFO L290 TraceCheckUtils]: 34: Hoare triple {190#true} [93] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {190#true} is VALID [2022-04-14 22:36:51,747 INFO L290 TraceCheckUtils]: 35: Hoare triple {190#true} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {190#true} is VALID [2022-04-14 22:36:51,748 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {190#true} {190#true} [123] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_6| (ite (<= (mod v_main_~b~0_11 4294967296) 65535) 1 0)) InVars {main_~b~0=v_main_~b~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_6|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {190#true} is VALID [2022-04-14 22:36:51,749 INFO L290 TraceCheckUtils]: 37: Hoare triple {190#true} [99] L30-->L43-2: Formula: (and (= v_main_~a~0_8 v_main_~v~0_6) (= v_main_~b~0_7 v_main_~y~0_7) (= v_main_~b~0_7 v_main_~u~0_6) (= v_main_~a~0_8 v_main_~x~0_7)) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_8} OutVars{main_~v~0=v_main_~v~0_6, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_7, main_~u~0=v_main_~u~0_6, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~v~0, main_~x~0, main_~y~0, main_~u~0] {306#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 22:36:51,749 INFO L290 TraceCheckUtils]: 38: Hoare triple {306#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} [102] L43-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {306#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 22:36:51,751 INFO L272 TraceCheckUtils]: 39: Hoare triple {306#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} [104] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (+ (* v_main_~y~0_10 v_main_~v~0_8) (* v_main_~x~0_10 v_main_~u~0_8)) 4294967296) (mod (* (* 2 v_main_~a~0_13) v_main_~b~0_12) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_8, main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_12, main_~u~0=v_main_~u~0_8, main_~a~0=v_main_~a~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {313#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 22:36:51,751 INFO L290 TraceCheckUtils]: 40: Hoare triple {313#(<= 1 |__VERIFIER_assert_#in~cond|)} [106] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {317#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 22:36:51,754 INFO L290 TraceCheckUtils]: 41: Hoare triple {317#(<= 1 __VERIFIER_assert_~cond)} [110] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {191#false} is VALID [2022-04-14 22:36:51,754 INFO L290 TraceCheckUtils]: 42: Hoare triple {191#false} [114] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#false} is VALID [2022-04-14 22:36:51,758 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-14 22:36:51,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 22:36:51,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 22:36:51,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283362127] [2022-04-14 22:36:51,758 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 22:36:51,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280166698] [2022-04-14 22:36:51,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280166698] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 22:36:51,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 22:36:51,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 22:36:51,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92926574] [2022-04-14 22:36:51,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 22:36:51,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2022-04-14 22:36:51,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 22:36:51,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-14 22:36:51,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 22:36:51,786 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 22:36:51,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 22:36:51,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 22:36:51,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 22:36:51,788 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-14 22:36:51,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:36:51,952 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-14 22:36:51,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 22:36:51,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2022-04-14 22:36:51,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 22:36:51,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-14 22:36:51,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-14 22:36:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-14 22:36:51,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-14 22:36:51,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-14 22:36:51,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 22:36:51,997 INFO L225 Difference]: With dead ends: 38 [2022-04-14 22:36:51,997 INFO L226 Difference]: Without dead ends: 37 [2022-04-14 22:36:51,998 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 22:36:51,998 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 22:36:51,999 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 105 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 22:36:51,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-14 22:36:52,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-04-14 22:36:52,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 22:36:52,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 36 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 22:36:52,003 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 36 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 22:36:52,003 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 36 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 22:36:52,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:36:52,005 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-04-14 22:36:52,005 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-04-14 22:36:52,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 22:36:52,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 22:36:52,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 37 states. [2022-04-14 22:36:52,006 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 37 states. [2022-04-14 22:36:52,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:36:52,008 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-04-14 22:36:52,008 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-04-14 22:36:52,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 22:36:52,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 22:36:52,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 22:36:52,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 22:36:52,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 22:36:52,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-14 22:36:52,011 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 43 [2022-04-14 22:36:52,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 22:36:52,011 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-14 22:36:52,011 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-14 22:36:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-14 22:36:52,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-14 22:36:52,012 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 22:36:52,012 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 22:36:52,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-14 22:36:52,227 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 22:36:52,228 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 22:36:52,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 22:36:52,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1282076869, now seen corresponding path program 1 times [2022-04-14 22:36:52,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 22:36:52,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329631840] [2022-04-14 22:36:52,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 22:36:52,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 22:36:52,255 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 22:36:52,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1910409587] [2022-04-14 22:36:52,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 22:36:52,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 22:36:52,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 22:36:52,288 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 22:36:52,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process