./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/xcsp/Dubois-015.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/xcsp/Dubois-015.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eba00f0070304f786aff86b6063ed55357e3f08cec960cb2b5a3d59a4f88aca7 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 00:32:47,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 00:32:47,317 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 00:32:47,348 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 00:32:47,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 00:32:47,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 00:32:47,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 00:32:47,354 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 00:32:47,356 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 00:32:47,357 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 00:32:47,358 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 00:32:47,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 00:32:47,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 00:32:47,361 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 00:32:47,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 00:32:47,364 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 00:32:47,365 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 00:32:47,366 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 00:32:47,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 00:32:47,370 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 00:32:47,372 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 00:32:47,374 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 00:32:47,375 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 00:32:47,376 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 00:32:47,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 00:32:47,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 00:32:47,381 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 00:32:47,387 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 00:32:47,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 00:32:47,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 00:32:47,389 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 00:32:47,390 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 00:32:47,391 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 00:32:47,392 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 00:32:47,393 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 00:32:47,393 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 00:32:47,394 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 00:32:47,394 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 00:32:47,394 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 00:32:47,395 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 00:32:47,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 00:32:47,396 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-07 00:32:47,419 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 00:32:47,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 00:32:47,420 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 00:32:47,420 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 00:32:47,420 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 00:32:47,421 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 00:32:47,421 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 00:32:47,421 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 00:32:47,421 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 00:32:47,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 00:32:47,421 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-07 00:32:47,422 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-07 00:32:47,422 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-07 00:32:47,422 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 00:32:47,422 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-07 00:32:47,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 00:32:47,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-07 00:32:47,422 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-07 00:32:47,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-07 00:32:47,422 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 00:32:47,426 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-07 00:32:47,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 00:32:47,426 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 00:32:47,426 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 00:32:47,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 00:32:47,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 00:32:47,427 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 00:32:47,427 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-07 00:32:47,427 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-07 00:32:47,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-07 00:32:47,427 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-07 00:32:47,427 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-07 00:32:47,427 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-07 00:32:47,428 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 00:32:47,428 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eba00f0070304f786aff86b6063ed55357e3f08cec960cb2b5a3d59a4f88aca7 [2021-12-07 00:32:47,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 00:32:47,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 00:32:47,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 00:32:47,611 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 00:32:47,612 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 00:32:47,613 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/xcsp/Dubois-015.c [2021-12-07 00:32:47,653 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/data/23a41c556/67fa9a1192464603b67b8d2054d89b59/FLAG4bcc457d9 [2021-12-07 00:32:48,047 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 00:32:48,048 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/sv-benchmarks/c/xcsp/Dubois-015.c [2021-12-07 00:32:48,054 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/data/23a41c556/67fa9a1192464603b67b8d2054d89b59/FLAG4bcc457d9 [2021-12-07 00:32:48,064 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/data/23a41c556/67fa9a1192464603b67b8d2054d89b59 [2021-12-07 00:32:48,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 00:32:48,067 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 00:32:48,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 00:32:48,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 00:32:48,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 00:32:48,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:32:48" (1/1) ... [2021-12-07 00:32:48,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bf8a7a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:48, skipping insertion in model container [2021-12-07 00:32:48,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:32:48" (1/1) ... [2021-12-07 00:32:48,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 00:32:48,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 00:32:48,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/sv-benchmarks/c/xcsp/Dubois-015.c[10980,10993] [2021-12-07 00:32:48,273 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 00:32:48,279 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 00:32:48,332 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/sv-benchmarks/c/xcsp/Dubois-015.c[10980,10993] [2021-12-07 00:32:48,334 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 00:32:48,344 INFO L208 MainTranslator]: Completed translation [2021-12-07 00:32:48,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:48 WrapperNode [2021-12-07 00:32:48,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 00:32:48,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 00:32:48,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 00:32:48,345 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 00:32:48,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:48" (1/1) ... [2021-12-07 00:32:48,362 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:48" (1/1) ... [2021-12-07 00:32:48,400 INFO L137 Inliner]: procedures = 13, calls = 127, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 317 [2021-12-07 00:32:48,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 00:32:48,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 00:32:48,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 00:32:48,402 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 00:32:48,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:48" (1/1) ... [2021-12-07 00:32:48,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:48" (1/1) ... [2021-12-07 00:32:48,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:48" (1/1) ... [2021-12-07 00:32:48,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:48" (1/1) ... [2021-12-07 00:32:48,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:48" (1/1) ... [2021-12-07 00:32:48,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:48" (1/1) ... [2021-12-07 00:32:48,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:48" (1/1) ... [2021-12-07 00:32:48,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 00:32:48,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 00:32:48,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 00:32:48,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 00:32:48,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:48" (1/1) ... [2021-12-07 00:32:48,444 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 00:32:48,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:32:48,468 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 00:32:48,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 00:32:48,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 00:32:48,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 00:32:48,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 00:32:48,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-07 00:32:48,503 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2021-12-07 00:32:48,503 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2021-12-07 00:32:48,560 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 00:32:48,561 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 00:32:48,814 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 00:32:48,822 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 00:32:48,822 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-07 00:32:48,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:32:48 BoogieIcfgContainer [2021-12-07 00:32:48,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 00:32:48,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 00:32:48,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 00:32:48,829 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 00:32:48,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:32:48" (1/3) ... [2021-12-07 00:32:48,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2eadd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:32:48, skipping insertion in model container [2021-12-07 00:32:48,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:48" (2/3) ... [2021-12-07 00:32:48,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2eadd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:32:48, skipping insertion in model container [2021-12-07 00:32:48,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:32:48" (3/3) ... [2021-12-07 00:32:48,832 INFO L111 eAbstractionObserver]: Analyzing ICFG Dubois-015.c [2021-12-07 00:32:48,837 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 00:32:48,837 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-07 00:32:48,880 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 00:32:48,885 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-07 00:32:48,886 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-07 00:32:48,903 INFO L276 IsEmpty]: Start isEmpty. Operand has 176 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 120 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2021-12-07 00:32:48,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2021-12-07 00:32:48,931 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:32:48,932 INFO L514 BasicCegarLoop]: trace histogram [120, 120, 120, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:48,932 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:32:48,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:48,937 INFO L85 PathProgramCache]: Analyzing trace with hash -742393268, now seen corresponding path program 1 times [2021-12-07 00:32:48,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:48,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470814706] [2021-12-07 00:32:48,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:48,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:49,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 00:32:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 00:32:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-07 00:32:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-07 00:32:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 00:32:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-07 00:32:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 00:32:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-07 00:32:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-07 00:32:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-07 00:32:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-07 00:32:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-07 00:32:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-07 00:32:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-07 00:32:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-07 00:32:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-07 00:32:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 00:32:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-07 00:32:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-07 00:32:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-07 00:32:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-07 00:32:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-07 00:32:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-07 00:32:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-07 00:32:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-12-07 00:32:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-12-07 00:32:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-07 00:32:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-07 00:32:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-07 00:32:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-07 00:32:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-12-07 00:32:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2021-12-07 00:32:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-12-07 00:32:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-12-07 00:32:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2021-12-07 00:32:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-12-07 00:32:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-07 00:32:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2021-12-07 00:32:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2021-12-07 00:32:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-07 00:32:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2021-12-07 00:32:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2021-12-07 00:32:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2021-12-07 00:32:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-12-07 00:32:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-12-07 00:32:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2021-12-07 00:32:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-07 00:32:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2021-12-07 00:32:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-12-07 00:32:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-12-07 00:32:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-12-07 00:32:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-07 00:32:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-12-07 00:32:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-07 00:32:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2021-12-07 00:32:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-07 00:32:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-12-07 00:32:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-12-07 00:32:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2021-12-07 00:32:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2021-12-07 00:32:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2021-12-07 00:32:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2021-12-07 00:32:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2021-12-07 00:32:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2021-12-07 00:32:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2021-12-07 00:32:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2021-12-07 00:32:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2021-12-07 00:32:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2021-12-07 00:32:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-12-07 00:32:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2021-12-07 00:32:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2021-12-07 00:32:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2021-12-07 00:32:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 398 [2021-12-07 00:32:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 403 [2021-12-07 00:32:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 409 [2021-12-07 00:32:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2021-12-07 00:32:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 420 [2021-12-07 00:32:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 425 [2021-12-07 00:32:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2021-12-07 00:32:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 436 [2021-12-07 00:32:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-12-07 00:32:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 447 [2021-12-07 00:32:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 453 [2021-12-07 00:32:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 458 [2021-12-07 00:32:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 464 [2021-12-07 00:32:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 469 [2021-12-07 00:32:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 475 [2021-12-07 00:32:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 480 [2021-12-07 00:32:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 486 [2021-12-07 00:32:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491 [2021-12-07 00:32:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 497 [2021-12-07 00:32:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 502 [2021-12-07 00:32:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 507 [2021-12-07 00:32:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 512 [2021-12-07 00:32:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 517 [2021-12-07 00:32:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 522 [2021-12-07 00:32:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 527 [2021-12-07 00:32:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 532 [2021-12-07 00:32:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 537 [2021-12-07 00:32:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 542 [2021-12-07 00:32:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 547 [2021-12-07 00:32:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 552 [2021-12-07 00:32:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 557 [2021-12-07 00:32:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 562 [2021-12-07 00:32:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 567 [2021-12-07 00:32:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 572 [2021-12-07 00:32:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 577 [2021-12-07 00:32:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 582 [2021-12-07 00:32:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 587 [2021-12-07 00:32:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 592 [2021-12-07 00:32:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 597 [2021-12-07 00:32:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 602 [2021-12-07 00:32:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 607 [2021-12-07 00:32:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 612 [2021-12-07 00:32:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 617 [2021-12-07 00:32:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 622 [2021-12-07 00:32:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 627 [2021-12-07 00:32:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 632 [2021-12-07 00:32:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 637 [2021-12-07 00:32:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 642 [2021-12-07 00:32:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:49,631 INFO L134 CoverageAnalysis]: Checked inductivity of 28560 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28560 trivial. 0 not checked. [2021-12-07 00:32:49,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:49,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470814706] [2021-12-07 00:32:49,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470814706] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:49,632 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:49,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 00:32:49,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422423176] [2021-12-07 00:32:49,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:49,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-07 00:32:49,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:49,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-07 00:32:49,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-07 00:32:49,662 INFO L87 Difference]: Start difference. First operand has 176 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 120 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 2 states have call successors, (120) [2021-12-07 00:32:49,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:32:49,704 INFO L93 Difference]: Finished difference Result 346 states and 704 transitions. [2021-12-07 00:32:49,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-07 00:32:49,706 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 2 states have call successors, (120) Word has length 648 [2021-12-07 00:32:49,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:32:49,714 INFO L225 Difference]: With dead ends: 346 [2021-12-07 00:32:49,714 INFO L226 Difference]: Without dead ends: 173 [2021-12-07 00:32:49,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-07 00:32:49,722 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:32:49,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:32:49,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-12-07 00:32:49,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2021-12-07 00:32:49,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 51 states have (on average 1.0) internal successors, (51), 51 states have internal predecessors, (51), 120 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2021-12-07 00:32:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 291 transitions. [2021-12-07 00:32:49,803 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 291 transitions. Word has length 648 [2021-12-07 00:32:49,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:32:49,803 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 291 transitions. [2021-12-07 00:32:49,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 2 states have call successors, (120) [2021-12-07 00:32:49,804 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 291 transitions. [2021-12-07 00:32:49,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2021-12-07 00:32:49,831 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:32:49,831 INFO L514 BasicCegarLoop]: trace histogram [120, 120, 120, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:49,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-07 00:32:49,832 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:32:49,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:49,833 INFO L85 PathProgramCache]: Analyzing trace with hash 818839756, now seen corresponding path program 1 times [2021-12-07 00:32:49,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:49,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132275348] [2021-12-07 00:32:49,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:49,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:32:50,077 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:32:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:32:50,325 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:32:50,325 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-07 00:32:50,326 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-07 00:32:50,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-07 00:32:50,331 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-12-07 00:32:50,335 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-07 00:32:50,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:32:50 BoogieIcfgContainer [2021-12-07 00:32:50,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-07 00:32:50,496 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-07 00:32:50,496 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-07 00:32:50,496 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-07 00:32:50,496 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:32:48" (3/4) ... [2021-12-07 00:32:50,498 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-07 00:32:50,498 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-07 00:32:50,499 INFO L158 Benchmark]: Toolchain (without parser) took 2431.95ms. Allocated memory was 138.4MB in the beginning and 167.8MB in the end (delta: 29.4MB). Free memory was 116.2MB in the beginning and 108.6MB in the end (delta: 7.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2021-12-07 00:32:50,500 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 75.5MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 00:32:50,500 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.59ms. Allocated memory is still 138.4MB. Free memory was 115.8MB in the beginning and 93.8MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-12-07 00:32:50,501 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.01ms. Allocated memory is still 138.4MB. Free memory was 93.8MB in the beginning and 89.2MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-07 00:32:50,501 INFO L158 Benchmark]: Boogie Preprocessor took 34.48ms. Allocated memory is still 138.4MB. Free memory was 89.2MB in the beginning and 86.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 00:32:50,502 INFO L158 Benchmark]: RCFGBuilder took 388.07ms. Allocated memory is still 138.4MB. Free memory was 86.5MB in the beginning and 111.0MB in the end (delta: -24.5MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2021-12-07 00:32:50,502 INFO L158 Benchmark]: TraceAbstraction took 1669.32ms. Allocated memory was 138.4MB in the beginning and 167.8MB in the end (delta: 29.4MB). Free memory was 110.4MB in the beginning and 109.6MB in the end (delta: 810.8kB). Peak memory consumption was 87.1MB. Max. memory is 16.1GB. [2021-12-07 00:32:50,502 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 108.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 00:32:50,506 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 75.5MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.59ms. Allocated memory is still 138.4MB. Free memory was 115.8MB in the beginning and 93.8MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.01ms. Allocated memory is still 138.4MB. Free memory was 93.8MB in the beginning and 89.2MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.48ms. Allocated memory is still 138.4MB. Free memory was 89.2MB in the beginning and 86.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 388.07ms. Allocated memory is still 138.4MB. Free memory was 86.5MB in the beginning and 111.0MB in the end (delta: -24.5MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1669.32ms. Allocated memory was 138.4MB in the beginning and 167.8MB in the end (delta: 29.4MB). Free memory was 110.4MB in the beginning and 109.6MB in the end (delta: 810.8kB). Peak memory consumption was 87.1MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 108.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 326]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 322. Possible FailurePath: [L22] int cond0; [L23] int dummy = 0; [L24] int N; [L25] int var0; [L26] var0 = __VERIFIER_nondet_int() [L27] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L27] RET assume(var0 >= 0) VAL [dummy=0, var0=0] [L28] CALL assume(var0 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L28] RET assume(var0 <= 1) VAL [dummy=0, var0=0] [L29] int var1; [L30] var1 = __VERIFIER_nondet_int() [L31] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L31] RET assume(var1 >= 0) VAL [dummy=0, var0=0, var1=0] [L32] CALL assume(var1 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L32] RET assume(var1 <= 1) VAL [dummy=0, var0=0, var1=0] [L33] int var2; [L34] var2 = __VERIFIER_nondet_int() [L35] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L35] RET assume(var2 >= 0) VAL [dummy=0, var0=0, var1=0, var2=1] [L36] CALL assume(var2 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L36] RET assume(var2 <= 1) VAL [dummy=0, var0=0, var1=0, var2=1] [L37] int var3; [L38] var3 = __VERIFIER_nondet_int() [L39] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L39] RET assume(var3 >= 0) VAL [dummy=0, var0=0, var1=0, var2=1, var3=0] [L40] CALL assume(var3 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L40] RET assume(var3 <= 1) VAL [dummy=0, var0=0, var1=0, var2=1, var3=0] [L41] int var4; [L42] var4 = __VERIFIER_nondet_int() [L43] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L43] RET assume(var4 >= 0) VAL [dummy=0, var0=0, var1=0, var2=1, var3=0, var4=1] [L44] CALL assume(var4 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L44] RET assume(var4 <= 1) VAL [dummy=0, var0=0, var1=0, var2=1, var3=0, var4=1] [L45] int var5; [L46] var5 = __VERIFIER_nondet_int() [L47] CALL assume(var5 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L47] RET assume(var5 >= 0) VAL [dummy=0, var0=0, var1=0, var2=1, var3=0, var4=1, var5=0] [L48] CALL assume(var5 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L48] RET assume(var5 <= 1) VAL [dummy=0, var0=0, var1=0, var2=1, var3=0, var4=1, var5=0] [L49] int var6; [L50] var6 = __VERIFIER_nondet_int() [L51] CALL assume(var6 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L51] RET assume(var6 >= 0) VAL [dummy=0, var0=0, var1=0, var2=1, var3=0, var4=1, var5=0, var6=0] [L52] CALL assume(var6 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L52] RET assume(var6 <= 1) VAL [dummy=0, var0=0, var1=0, var2=1, var3=0, var4=1, var5=0, var6=0] [L53] int var7; [L54] var7 = __VERIFIER_nondet_int() [L55] CALL assume(var7 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L55] RET assume(var7 >= 0) VAL [dummy=0, var0=0, var1=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=1] [L56] CALL assume(var7 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L56] RET assume(var7 <= 1) VAL [dummy=0, var0=0, var1=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=1] [L57] int var8; [L58] var8 = __VERIFIER_nondet_int() [L59] CALL assume(var8 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L59] RET assume(var8 >= 0) VAL [dummy=0, var0=0, var1=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1] [L60] CALL assume(var8 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L60] RET assume(var8 <= 1) VAL [dummy=0, var0=0, var1=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1] [L61] int var9; [L62] var9 = __VERIFIER_nondet_int() [L63] CALL assume(var9 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L63] RET assume(var9 >= 0) VAL [dummy=0, var0=0, var1=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L64] CALL assume(var9 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L64] RET assume(var9 <= 1) VAL [dummy=0, var0=0, var1=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L65] int var10; [L66] var10 = __VERIFIER_nondet_int() [L67] CALL assume(var10 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L67] RET assume(var10 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L68] CALL assume(var10 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L68] RET assume(var10 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L69] int var11; [L70] var11 = __VERIFIER_nondet_int() [L71] CALL assume(var11 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L71] RET assume(var11 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L72] CALL assume(var11 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L72] RET assume(var11 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L73] int var12; [L74] var12 = __VERIFIER_nondet_int() [L75] CALL assume(var12 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L75] RET assume(var12 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L76] CALL assume(var12 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L76] RET assume(var12 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L77] int var13; [L78] var13 = __VERIFIER_nondet_int() [L79] CALL assume(var13 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L79] RET assume(var13 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var2=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L80] CALL assume(var13 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L80] RET assume(var13 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var2=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L81] int var14; [L82] var14 = __VERIFIER_nondet_int() [L83] CALL assume(var14 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L83] RET assume(var14 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L84] CALL assume(var14 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L84] RET assume(var14 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L85] int var15; [L86] var15 = __VERIFIER_nondet_int() [L87] CALL assume(var15 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L87] RET assume(var15 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L88] CALL assume(var15 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L88] RET assume(var15 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L89] int var16; [L90] var16 = __VERIFIER_nondet_int() [L91] CALL assume(var16 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L91] RET assume(var16 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var2=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L92] CALL assume(var16 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L92] RET assume(var16 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var2=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L93] int var17; [L94] var17 = __VERIFIER_nondet_int() [L95] CALL assume(var17 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L95] RET assume(var17 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L96] CALL assume(var17 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L96] RET assume(var17 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var2=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L97] int var18; [L98] var18 = __VERIFIER_nondet_int() [L99] CALL assume(var18 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L99] RET assume(var18 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var2=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L100] CALL assume(var18 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L100] RET assume(var18 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var2=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L101] int var19; [L102] var19 = __VERIFIER_nondet_int() [L103] CALL assume(var19 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L103] RET assume(var19 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L104] CALL assume(var19 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L104] RET assume(var19 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L105] int var20; [L106] var20 = __VERIFIER_nondet_int() [L107] CALL assume(var20 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L107] RET assume(var20 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L108] CALL assume(var20 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L108] RET assume(var20 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L109] int var21; [L110] var21 = __VERIFIER_nondet_int() [L111] CALL assume(var21 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L111] RET assume(var21 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L112] CALL assume(var21 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L112] RET assume(var21 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L113] int var22; [L114] var22 = __VERIFIER_nondet_int() [L115] CALL assume(var22 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L115] RET assume(var22 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L116] CALL assume(var22 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L116] RET assume(var22 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L117] int var23; [L118] var23 = __VERIFIER_nondet_int() [L119] CALL assume(var23 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L119] RET assume(var23 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L120] CALL assume(var23 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L120] RET assume(var23 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L121] int var24; [L122] var24 = __VERIFIER_nondet_int() [L123] CALL assume(var24 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L123] RET assume(var24 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L124] CALL assume(var24 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L124] RET assume(var24 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L125] int var25; [L126] var25 = __VERIFIER_nondet_int() [L127] CALL assume(var25 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L127] RET assume(var25 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L128] CALL assume(var25 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L128] RET assume(var25 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L129] int var26; [L130] var26 = __VERIFIER_nondet_int() [L131] CALL assume(var26 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L131] RET assume(var26 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L132] CALL assume(var26 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L132] RET assume(var26 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L133] int var27; [L134] var27 = __VERIFIER_nondet_int() [L135] CALL assume(var27 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L135] RET assume(var27 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L136] CALL assume(var27 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L136] RET assume(var27 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L137] int var28; [L138] var28 = __VERIFIER_nondet_int() [L139] CALL assume(var28 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L139] RET assume(var28 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L140] CALL assume(var28 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L140] RET assume(var28 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L141] int var29; [L142] var29 = __VERIFIER_nondet_int() [L143] CALL assume(var29 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L143] RET assume(var29 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L144] CALL assume(var29 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L144] RET assume(var29 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L145] int var30; [L146] var30 = __VERIFIER_nondet_int() [L147] CALL assume(var30 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L147] RET assume(var30 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L148] CALL assume(var30 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L148] RET assume(var30 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L149] int var31; [L150] var31 = __VERIFIER_nondet_int() [L151] CALL assume(var31 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L151] RET assume(var31 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L152] CALL assume(var31 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L152] RET assume(var31 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L153] int var32; [L154] var32 = __VERIFIER_nondet_int() [L155] CALL assume(var32 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L155] RET assume(var32 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L156] CALL assume(var32 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L156] RET assume(var32 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L157] int var33; [L158] var33 = __VERIFIER_nondet_int() [L159] CALL assume(var33 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L159] RET assume(var33 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L160] CALL assume(var33 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L160] RET assume(var33 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L161] int var34; [L162] var34 = __VERIFIER_nondet_int() [L163] CALL assume(var34 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L163] RET assume(var34 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L164] CALL assume(var34 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L164] RET assume(var34 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L165] int var35; [L166] var35 = __VERIFIER_nondet_int() [L167] CALL assume(var35 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L167] RET assume(var35 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L168] CALL assume(var35 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L168] RET assume(var35 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L169] int var36; [L170] var36 = __VERIFIER_nondet_int() [L171] CALL assume(var36 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L171] RET assume(var36 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L172] CALL assume(var36 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L172] RET assume(var36 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L173] int var37; [L174] var37 = __VERIFIER_nondet_int() [L175] CALL assume(var37 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L175] RET assume(var37 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L176] CALL assume(var37 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L176] RET assume(var37 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L177] int var38; [L178] var38 = __VERIFIER_nondet_int() [L179] CALL assume(var38 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L179] RET assume(var38 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L180] CALL assume(var38 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L180] RET assume(var38 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L181] int var39; [L182] var39 = __VERIFIER_nondet_int() [L183] CALL assume(var39 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L183] RET assume(var39 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L184] CALL assume(var39 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L184] RET assume(var39 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L185] int var40; [L186] var40 = __VERIFIER_nondet_int() [L187] CALL assume(var40 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L187] RET assume(var40 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L188] CALL assume(var40 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L188] RET assume(var40 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L189] int var41; [L190] var41 = __VERIFIER_nondet_int() [L191] CALL assume(var41 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L191] RET assume(var41 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L192] CALL assume(var41 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L192] RET assume(var41 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L193] int var42; [L194] var42 = __VERIFIER_nondet_int() [L195] CALL assume(var42 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L195] RET assume(var42 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L196] CALL assume(var42 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L196] RET assume(var42 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var5=0, var6=0, var7=1, var8=1, var9=0] [L197] int var43; [L198] var43 = __VERIFIER_nondet_int() [L199] CALL assume(var43 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L199] RET assume(var43 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L200] CALL assume(var43 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L200] RET assume(var43 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L201] int var44; [L202] var44 = __VERIFIER_nondet_int() [L203] CALL assume(var44 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L203] RET assume(var44 >= 0) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L204] CALL assume(var44 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L204] RET assume(var44 <= 1) VAL [dummy=0, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L205] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L206-L209] CALL assume((var28 == 0 & var29 == 0 & var0 == 1) | (var28 == 0 & var29 == 1 & var0 == 0) | (var28 == 1 & var29 == 0 & var0 == 0) | (var28 == 1 & var29 == 1 & var0 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=57, cond=57] [L206-L209] RET assume((var28 == 0 & var29 == 0 & var0 == 1) | (var28 == 0 & var29 == 1 & var0 == 0) | (var28 == 1 & var29 == 0 & var0 == 0) | (var28 == 1 & var29 == 1 & var0 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L210-L213] CALL assume((var1 == 0 & var31 == 0 & var2 == 1) | (var1 == 0 & var31 == 1 & var2 == 0) | (var1 == 1 & var31 == 0 & var2 == 0) | (var1 == 1 & var31 == 1 & var2 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=77, cond=77] [L210-L213] RET assume((var1 == 0 & var31 == 0 & var2 == 1) | (var1 == 0 & var31 == 1 & var2 == 0) | (var1 == 1 & var31 == 0 & var2 == 0) | (var1 == 1 & var31 == 1 & var2 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L214-L217] CALL assume((var2 == 0 & var32 == 0 & var3 == 1) | (var2 == 0 & var32 == 1 & var3 == 0) | (var2 == 1 & var32 == 0 & var3 == 0) | (var2 == 1 & var32 == 1 & var3 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=73, cond=73] [L214-L217] RET assume((var2 == 0 & var32 == 0 & var3 == 1) | (var2 == 0 & var32 == 1 & var3 == 0) | (var2 == 1 & var32 == 0 & var3 == 0) | (var2 == 1 & var32 == 1 & var3 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L218-L221] CALL assume((var3 == 0 & var33 == 0 & var4 == 1) | (var3 == 0 & var33 == 1 & var4 == 0) | (var3 == 1 & var33 == 0 & var4 == 0) | (var3 == 1 & var33 == 1 & var4 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=51, cond=51] [L218-L221] RET assume((var3 == 0 & var33 == 0 & var4 == 1) | (var3 == 0 & var33 == 1 & var4 == 0) | (var3 == 1 & var33 == 0 & var4 == 0) | (var3 == 1 & var33 == 1 & var4 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L222-L225] CALL assume((var4 == 0 & var34 == 0 & var5 == 1) | (var4 == 0 & var34 == 1 & var5 == 0) | (var4 == 1 & var34 == 0 & var5 == 0) | (var4 == 1 & var34 == 1 & var5 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=67, cond=67] [L222-L225] RET assume((var4 == 0 & var34 == 0 & var5 == 1) | (var4 == 0 & var34 == 1 & var5 == 0) | (var4 == 1 & var34 == 0 & var5 == 0) | (var4 == 1 & var34 == 1 & var5 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L226-L229] CALL assume((var5 == 0 & var35 == 0 & var6 == 1) | (var5 == 0 & var35 == 1 & var6 == 0) | (var5 == 1 & var35 == 0 & var6 == 0) | (var5 == 1 & var35 == 1 & var6 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=68, cond=68] [L226-L229] RET assume((var5 == 0 & var35 == 0 & var6 == 1) | (var5 == 0 & var35 == 1 & var6 == 0) | (var5 == 1 & var35 == 0 & var6 == 0) | (var5 == 1 & var35 == 1 & var6 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L230-L233] CALL assume((var6 == 0 & var36 == 0 & var7 == 1) | (var6 == 0 & var36 == 1 & var7 == 0) | (var6 == 1 & var36 == 0 & var7 == 0) | (var6 == 1 & var36 == 1 & var7 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=63, cond=63] [L230-L233] RET assume((var6 == 0 & var36 == 0 & var7 == 1) | (var6 == 0 & var36 == 1 & var7 == 0) | (var6 == 1 & var36 == 0 & var7 == 0) | (var6 == 1 & var36 == 1 & var7 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L234-L237] CALL assume((var7 == 0 & var37 == 0 & var8 == 1) | (var7 == 0 & var37 == 1 & var8 == 0) | (var7 == 1 & var37 == 0 & var8 == 0) | (var7 == 1 & var37 == 1 & var8 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=49, cond=49] [L234-L237] RET assume((var7 == 0 & var37 == 0 & var8 == 1) | (var7 == 0 & var37 == 1 & var8 == 0) | (var7 == 1 & var37 == 0 & var8 == 0) | (var7 == 1 & var37 == 1 & var8 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L238-L241] CALL assume((var8 == 0 & var38 == 0 & var9 == 1) | (var8 == 0 & var38 == 1 & var9 == 0) | (var8 == 1 & var38 == 0 & var9 == 0) | (var8 == 1 & var38 == 1 & var9 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=74, cond=74] [L238-L241] RET assume((var8 == 0 & var38 == 0 & var9 == 1) | (var8 == 0 & var38 == 1 & var9 == 0) | (var8 == 1 & var38 == 0 & var9 == 0) | (var8 == 1 & var38 == 1 & var9 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L242-L245] CALL assume((var9 == 0 & var39 == 0 & var10 == 1) | (var9 == 0 & var39 == 1 & var10 == 0) | (var9 == 1 & var39 == 0 & var10 == 0) | (var9 == 1 & var39 == 1 & var10 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=52, cond=52] [L242-L245] RET assume((var9 == 0 & var39 == 0 & var10 == 1) | (var9 == 0 & var39 == 1 & var10 == 0) | (var9 == 1 & var39 == 0 & var10 == 0) | (var9 == 1 & var39 == 1 & var10 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L246-L249] CALL assume((var10 == 0 & var40 == 0 & var11 == 1) | (var10 == 0 & var40 == 1 & var11 == 0) | (var10 == 1 & var40 == 0 & var11 == 0) | (var10 == 1 & var40 == 1 & var11 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=78, cond=78] [L246-L249] RET assume((var10 == 0 & var40 == 0 & var11 == 1) | (var10 == 0 & var40 == 1 & var11 == 0) | (var10 == 1 & var40 == 0 & var11 == 0) | (var10 == 1 & var40 == 1 & var11 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L250-L253] CALL assume((var11 == 0 & var41 == 0 & var12 == 1) | (var11 == 0 & var41 == 1 & var12 == 0) | (var11 == 1 & var41 == 0 & var12 == 0) | (var11 == 1 & var41 == 1 & var12 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=58, cond=58] [L250-L253] RET assume((var11 == 0 & var41 == 0 & var12 == 1) | (var11 == 0 & var41 == 1 & var12 == 0) | (var11 == 1 & var41 == 0 & var12 == 0) | (var11 == 1 & var41 == 1 & var12 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L254-L257] CALL assume((var12 == 0 & var42 == 0 & var13 == 1) | (var12 == 0 & var42 == 1 & var13 == 0) | (var12 == 1 & var42 == 0 & var13 == 0) | (var12 == 1 & var42 == 1 & var13 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=62, cond=62] [L254-L257] RET assume((var12 == 0 & var42 == 0 & var13 == 1) | (var12 == 0 & var42 == 1 & var13 == 0) | (var12 == 1 & var42 == 0 & var13 == 0) | (var12 == 1 & var42 == 1 & var13 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L258-L261] CALL assume((var0 == 0 & var30 == 0 & var1 == 1) | (var0 == 0 & var30 == 1 & var1 == 0) | (var0 == 1 & var30 == 0 & var1 == 0) | (var0 == 1 & var30 == 1 & var1 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=70, cond=70] [L258-L261] RET assume((var0 == 0 & var30 == 0 & var1 == 1) | (var0 == 0 & var30 == 1 & var1 == 0) | (var0 == 1 & var30 == 0 & var1 == 0) | (var0 == 1 & var30 == 1 & var1 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L262-L265] CALL assume((var14 == 0 & var43 == 0 & var44 == 1) | (var14 == 0 & var43 == 1 & var44 == 0) | (var14 == 1 & var43 == 0 & var44 == 0) | (var14 == 1 & var43 == 1 & var44 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=69, cond=69] [L262-L265] RET assume((var14 == 0 & var43 == 0 & var44 == 1) | (var14 == 0 & var43 == 1 & var44 == 0) | (var14 == 1 & var43 == 0 & var44 == 0) | (var14 == 1 & var43 == 1 & var44 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L266-L269] CALL assume((var13 == 0 & var43 == 0 & var44 == 1) | (var13 == 0 & var43 == 1 & var44 == 0) | (var13 == 1 & var43 == 0 & var44 == 0) | (var13 == 1 & var43 == 1 & var44 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=50, cond=50] [L266-L269] RET assume((var13 == 0 & var43 == 0 & var44 == 1) | (var13 == 0 & var43 == 1 & var44 == 0) | (var13 == 1 & var43 == 0 & var44 == 0) | (var13 == 1 & var43 == 1 & var44 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L270-L273] CALL assume((var16 == 0 & var41 == 0 & var15 == 1) | (var16 == 0 & var41 == 1 & var15 == 0) | (var16 == 1 & var41 == 0 & var15 == 0) | (var16 == 1 & var41 == 1 & var15 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=60, cond=60] [L270-L273] RET assume((var16 == 0 & var41 == 0 & var15 == 1) | (var16 == 0 & var41 == 1 & var15 == 0) | (var16 == 1 & var41 == 0 & var15 == 0) | (var16 == 1 & var41 == 1 & var15 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L274-L277] CALL assume((var17 == 0 & var40 == 0 & var16 == 1) | (var17 == 0 & var40 == 1 & var16 == 0) | (var17 == 1 & var40 == 0 & var16 == 0) | (var17 == 1 & var40 == 1 & var16 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=61, cond=61] [L274-L277] RET assume((var17 == 0 & var40 == 0 & var16 == 1) | (var17 == 0 & var40 == 1 & var16 == 0) | (var17 == 1 & var40 == 0 & var16 == 0) | (var17 == 1 & var40 == 1 & var16 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L278-L281] CALL assume((var18 == 0 & var39 == 0 & var17 == 1) | (var18 == 0 & var39 == 1 & var17 == 0) | (var18 == 1 & var39 == 0 & var17 == 0) | (var18 == 1 & var39 == 1 & var17 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=66, cond=66] [L278-L281] RET assume((var18 == 0 & var39 == 0 & var17 == 1) | (var18 == 0 & var39 == 1 & var17 == 0) | (var18 == 1 & var39 == 0 & var17 == 0) | (var18 == 1 & var39 == 1 & var17 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L282-L285] CALL assume((var19 == 0 & var38 == 0 & var18 == 1) | (var19 == 0 & var38 == 1 & var18 == 0) | (var19 == 1 & var38 == 0 & var18 == 0) | (var19 == 1 & var38 == 1 & var18 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=75, cond=75] [L282-L285] RET assume((var19 == 0 & var38 == 0 & var18 == 1) | (var19 == 0 & var38 == 1 & var18 == 0) | (var19 == 1 & var38 == 0 & var18 == 0) | (var19 == 1 & var38 == 1 & var18 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L286-L289] CALL assume((var20 == 0 & var37 == 0 & var19 == 1) | (var20 == 0 & var37 == 1 & var19 == 0) | (var20 == 1 & var37 == 0 & var19 == 0) | (var20 == 1 & var37 == 1 & var19 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=55, cond=55] [L286-L289] RET assume((var20 == 0 & var37 == 0 & var19 == 1) | (var20 == 0 & var37 == 1 & var19 == 0) | (var20 == 1 & var37 == 0 & var19 == 0) | (var20 == 1 & var37 == 1 & var19 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L290-L293] CALL assume((var21 == 0 & var36 == 0 & var20 == 1) | (var21 == 0 & var36 == 1 & var20 == 0) | (var21 == 1 & var36 == 0 & var20 == 0) | (var21 == 1 & var36 == 1 & var20 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=54, cond=54] [L290-L293] RET assume((var21 == 0 & var36 == 0 & var20 == 1) | (var21 == 0 & var36 == 1 & var20 == 0) | (var21 == 1 & var36 == 0 & var20 == 0) | (var21 == 1 & var36 == 1 & var20 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L294-L297] CALL assume((var22 == 0 & var35 == 0 & var21 == 1) | (var22 == 0 & var35 == 1 & var21 == 0) | (var22 == 1 & var35 == 0 & var21 == 0) | (var22 == 1 & var35 == 1 & var21 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=56, cond=56] [L294-L297] RET assume((var22 == 0 & var35 == 0 & var21 == 1) | (var22 == 0 & var35 == 1 & var21 == 0) | (var22 == 1 & var35 == 0 & var21 == 0) | (var22 == 1 & var35 == 1 & var21 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L298-L301] CALL assume((var23 == 0 & var34 == 0 & var22 == 1) | (var23 == 0 & var34 == 1 & var22 == 0) | (var23 == 1 & var34 == 0 & var22 == 0) | (var23 == 1 & var34 == 1 & var22 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=72, cond=72] [L298-L301] RET assume((var23 == 0 & var34 == 0 & var22 == 1) | (var23 == 0 & var34 == 1 & var22 == 0) | (var23 == 1 & var34 == 0 & var22 == 0) | (var23 == 1 & var34 == 1 & var22 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L302-L305] CALL assume((var24 == 0 & var33 == 0 & var23 == 1) | (var24 == 0 & var33 == 1 & var23 == 0) | (var24 == 1 & var33 == 0 & var23 == 0) | (var24 == 1 & var33 == 1 & var23 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=71, cond=71] [L302-L305] RET assume((var24 == 0 & var33 == 0 & var23 == 1) | (var24 == 0 & var33 == 1 & var23 == 0) | (var24 == 1 & var33 == 0 & var23 == 0) | (var24 == 1 & var33 == 1 & var23 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L306-L309] CALL assume((var25 == 0 & var32 == 0 & var24 == 1) | (var25 == 0 & var32 == 1 & var24 == 0) | (var25 == 1 & var32 == 0 & var24 == 0) | (var25 == 1 & var32 == 1 & var24 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=64, cond=64] [L306-L309] RET assume((var25 == 0 & var32 == 0 & var24 == 1) | (var25 == 0 & var32 == 1 & var24 == 0) | (var25 == 1 & var32 == 0 & var24 == 0) | (var25 == 1 & var32 == 1 & var24 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L310-L313] CALL assume((var26 == 0 & var31 == 0 & var25 == 1) | (var26 == 0 & var31 == 1 & var25 == 0) | (var26 == 1 & var31 == 0 & var25 == 0) | (var26 == 1 & var31 == 1 & var25 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=53, cond=53] [L310-L313] RET assume((var26 == 0 & var31 == 0 & var25 == 1) | (var26 == 0 & var31 == 1 & var25 == 0) | (var26 == 1 & var31 == 0 & var25 == 0) | (var26 == 1 & var31 == 1 & var25 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L314-L317] CALL assume((var27 == 0 & var30 == 0 & var26 == 1) | (var27 == 0 & var30 == 1 & var26 == 0) | (var27 == 1 & var30 == 0 & var26 == 0) | (var27 == 1 & var30 == 1 & var26 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=59, cond=59] [L314-L317] RET assume((var27 == 0 & var30 == 0 & var26 == 1) | (var27 == 0 & var30 == 1 & var26 == 0) | (var27 == 1 & var30 == 0 & var26 == 0) | (var27 == 1 & var30 == 1 & var26 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L318-L321] CALL assume((var15 == 0 & var42 == 0 & var14 == 1) | (var15 == 0 & var42 == 1 & var14 == 0) | (var15 == 1 & var42 == 0 & var14 == 0) | (var15 == 1 & var42 == 1 & var14 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=76, cond=76] [L318-L321] RET assume((var15 == 0 & var42 == 0 & var14 == 1) | (var15 == 0 & var42 == 1 & var14 == 0) | (var15 == 1 & var42 == 0 & var14 == 0) | (var15 == 1 & var42 == 1 & var14 == 1) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L322-L325] CALL assume((var28 == 0 & var29 == 0 & var27 == 0) | (var28 == 0 & var29 == 1 & var27 == 1) | (var28 == 1 & var29 == 0 & var27 == 1) | (var28 == 1 & var29 == 1 & var27 == 0) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=65, cond=65] [L322-L325] RET assume((var28 == 0 & var29 == 0 & var27 == 0) | (var28 == 0 & var29 == 1 & var27 == 1) | (var28 == 1 & var29 == 0 & var27 == 1) | (var28 == 1 & var29 == 1 & var27 == 0) | 0) VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] [L326] reach_error() VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=1, var14=0, var15=0, var16=1, var17=0, var18=1, var19=1, var2=1, var20=1, var21=1, var22=1, var23=0, var24=1, var25=0, var26=0, var27=1, var28=0, var29=0, var3=0, var30=1, var31=0, var32=1, var33=1, var34=1, var35=0, var36=0, var37=1, var38=1, var39=1, var4=1, var40=1, var41=0, var42=1, var43=0, var44=0, var5=0, var6=0, var7=1, var8=1, var9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 176 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 2, TraceHistogramMax: 120, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 291 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 291 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 362 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1296 NumberOfCodeBlocks, 1296 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 647 ConstructedInterpolants, 0 QuantifiedInterpolants, 647 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 28560/28560 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-07 00:32:50,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/xcsp/Dubois-015.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eba00f0070304f786aff86b6063ed55357e3f08cec960cb2b5a3d59a4f88aca7 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 00:32:52,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 00:32:52,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 00:32:52,165 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 00:32:52,165 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 00:32:52,166 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 00:32:52,167 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 00:32:52,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 00:32:52,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 00:32:52,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 00:32:52,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 00:32:52,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 00:32:52,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 00:32:52,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 00:32:52,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 00:32:52,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 00:32:52,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 00:32:52,179 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 00:32:52,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 00:32:52,183 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 00:32:52,185 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 00:32:52,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 00:32:52,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 00:32:52,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 00:32:52,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 00:32:52,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 00:32:52,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 00:32:52,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 00:32:52,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 00:32:52,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 00:32:52,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 00:32:52,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 00:32:52,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 00:32:52,196 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 00:32:52,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 00:32:52,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 00:32:52,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 00:32:52,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 00:32:52,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 00:32:52,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 00:32:52,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 00:32:52,201 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-07 00:32:52,220 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 00:32:52,221 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 00:32:52,221 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 00:32:52,221 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 00:32:52,222 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 00:32:52,222 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 00:32:52,222 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 00:32:52,222 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 00:32:52,222 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 00:32:52,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 00:32:52,223 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-07 00:32:52,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-07 00:32:52,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 00:32:52,223 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-07 00:32:52,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 00:32:52,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-07 00:32:52,224 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-07 00:32:52,224 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-07 00:32:52,224 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-07 00:32:52,224 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-07 00:32:52,224 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-07 00:32:52,224 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 00:32:52,224 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-07 00:32:52,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 00:32:52,225 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 00:32:52,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 00:32:52,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 00:32:52,225 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 00:32:52,225 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 00:32:52,225 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-07 00:32:52,225 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-07 00:32:52,225 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-07 00:32:52,226 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-07 00:32:52,226 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-07 00:32:52,226 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-07 00:32:52,226 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 00:32:52,226 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-07 00:32:52,226 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eba00f0070304f786aff86b6063ed55357e3f08cec960cb2b5a3d59a4f88aca7 [2021-12-07 00:32:52,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 00:32:52,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 00:32:52,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 00:32:52,477 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 00:32:52,477 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 00:32:52,478 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/xcsp/Dubois-015.c [2021-12-07 00:32:52,522 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/data/83ae4a273/c49b269503e242efb359ec28293deff3/FLAGfebc9d899 [2021-12-07 00:32:52,928 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 00:32:52,929 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/sv-benchmarks/c/xcsp/Dubois-015.c [2021-12-07 00:32:52,936 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/data/83ae4a273/c49b269503e242efb359ec28293deff3/FLAGfebc9d899 [2021-12-07 00:32:52,946 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/data/83ae4a273/c49b269503e242efb359ec28293deff3 [2021-12-07 00:32:52,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 00:32:52,949 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 00:32:52,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 00:32:52,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 00:32:52,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 00:32:52,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:32:52" (1/1) ... [2021-12-07 00:32:52,954 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36b33b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:52, skipping insertion in model container [2021-12-07 00:32:52,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:32:52" (1/1) ... [2021-12-07 00:32:52,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 00:32:52,985 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 00:32:53,151 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/sv-benchmarks/c/xcsp/Dubois-015.c[10980,10993] [2021-12-07 00:32:53,156 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 00:32:53,171 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 00:32:53,236 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/sv-benchmarks/c/xcsp/Dubois-015.c[10980,10993] [2021-12-07 00:32:53,238 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 00:32:53,248 INFO L208 MainTranslator]: Completed translation [2021-12-07 00:32:53,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:53 WrapperNode [2021-12-07 00:32:53,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 00:32:53,249 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 00:32:53,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 00:32:53,249 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 00:32:53,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:53" (1/1) ... [2021-12-07 00:32:53,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:53" (1/1) ... [2021-12-07 00:32:53,300 INFO L137 Inliner]: procedures = 13, calls = 127, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 272 [2021-12-07 00:32:53,300 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 00:32:53,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 00:32:53,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 00:32:53,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 00:32:53,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:53" (1/1) ... [2021-12-07 00:32:53,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:53" (1/1) ... [2021-12-07 00:32:53,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:53" (1/1) ... [2021-12-07 00:32:53,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:53" (1/1) ... [2021-12-07 00:32:53,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:53" (1/1) ... [2021-12-07 00:32:53,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:53" (1/1) ... [2021-12-07 00:32:53,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:53" (1/1) ... [2021-12-07 00:32:53,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 00:32:53,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 00:32:53,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 00:32:53,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 00:32:53,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:53" (1/1) ... [2021-12-07 00:32:53,341 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 00:32:53,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:32:53,365 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 00:32:53,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 00:32:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 00:32:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 00:32:53,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 00:32:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-07 00:32:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2021-12-07 00:32:53,396 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2021-12-07 00:32:53,457 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 00:32:53,458 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 00:32:53,730 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 00:32:53,739 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 00:32:53,739 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-07 00:32:53,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:32:53 BoogieIcfgContainer [2021-12-07 00:32:53,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 00:32:53,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 00:32:53,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 00:32:53,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 00:32:53,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:32:52" (1/3) ... [2021-12-07 00:32:53,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a68862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:32:53, skipping insertion in model container [2021-12-07 00:32:53,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:53" (2/3) ... [2021-12-07 00:32:53,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a68862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:32:53, skipping insertion in model container [2021-12-07 00:32:53,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:32:53" (3/3) ... [2021-12-07 00:32:53,749 INFO L111 eAbstractionObserver]: Analyzing ICFG Dubois-015.c [2021-12-07 00:32:53,754 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 00:32:53,754 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-07 00:32:53,796 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 00:32:53,801 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-07 00:32:53,801 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-07 00:32:53,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 176 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 120 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2021-12-07 00:32:53,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2021-12-07 00:32:53,857 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:32:53,858 INFO L514 BasicCegarLoop]: trace histogram [120, 120, 120, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:53,859 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:32:53,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:53,865 INFO L85 PathProgramCache]: Analyzing trace with hash -742393268, now seen corresponding path program 1 times [2021-12-07 00:32:53,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 00:32:53,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857385358] [2021-12-07 00:32:53,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:53,880 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 00:32:53,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 00:32:53,881 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 00:32:53,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-07 00:32:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:54,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 901 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-07 00:32:54,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:32:54,868 INFO L134 CoverageAnalysis]: Checked inductivity of 28560 backedges. 1174 proven. 0 refuted. 0 times theorem prover too weak. 27386 trivial. 0 not checked. [2021-12-07 00:32:54,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 00:32:54,869 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 00:32:54,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857385358] [2021-12-07 00:32:54,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1857385358] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:54,870 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:54,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 00:32:54,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297644050] [2021-12-07 00:32:54,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:54,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-07 00:32:54,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 00:32:54,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-07 00:32:54,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-07 00:32:54,899 INFO L87 Difference]: Start difference. First operand has 176 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 120 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (120), 2 states have call predecessors, (120), 2 states have return successors, (120), 2 states have call predecessors, (120), 2 states have call successors, (120) [2021-12-07 00:32:54,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:32:54,942 INFO L93 Difference]: Finished difference Result 346 states and 704 transitions. [2021-12-07 00:32:54,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-07 00:32:54,944 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (120), 2 states have call predecessors, (120), 2 states have return successors, (120), 2 states have call predecessors, (120), 2 states have call successors, (120) Word has length 648 [2021-12-07 00:32:54,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:32:54,951 INFO L225 Difference]: With dead ends: 346 [2021-12-07 00:32:54,951 INFO L226 Difference]: Without dead ends: 173 [2021-12-07 00:32:54,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 647 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-07 00:32:54,959 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:32:54,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:32:54,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-12-07 00:32:55,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2021-12-07 00:32:55,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 51 states have (on average 1.0) internal successors, (51), 51 states have internal predecessors, (51), 120 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2021-12-07 00:32:55,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 291 transitions. [2021-12-07 00:32:55,027 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 291 transitions. Word has length 648 [2021-12-07 00:32:55,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:32:55,028 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 291 transitions. [2021-12-07 00:32:55,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (120), 2 states have call predecessors, (120), 2 states have return successors, (120), 2 states have call predecessors, (120), 2 states have call successors, (120) [2021-12-07 00:32:55,028 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 291 transitions. [2021-12-07 00:32:55,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2021-12-07 00:32:55,062 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:32:55,063 INFO L514 BasicCegarLoop]: trace histogram [120, 120, 120, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:55,076 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-07 00:32:55,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 00:32:55,264 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:32:55,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:55,265 INFO L85 PathProgramCache]: Analyzing trace with hash 818839756, now seen corresponding path program 1 times [2021-12-07 00:32:55,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 00:32:55,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909648028] [2021-12-07 00:32:55,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:55,267 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 00:32:55,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 00:32:55,268 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 00:32:55,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03c408d-075e-4e9f-b082-45f02868d83f/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-07 00:33:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:33:08,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 901 conjuncts, 216 conjunts are in the unsatisfiable core [2021-12-07 00:33:08,337 INFO L286 TraceCheckSpWp]: Computing forward predicates...