./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/xcsp/Dubois-017.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/config/AutomizerReach.xml -i ../../sv-benchmarks/c/xcsp/Dubois-017.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL --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 0161797d3d47f58b7fc5d66ce82438765cea4779ac8884472a06ee6979f47801 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 05:20:28,641 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 05:20:28,643 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 05:20:28,692 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 05:20:28,693 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 05:20:28,699 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 05:20:28,701 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 05:20:28,706 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 05:20:28,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 05:20:28,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 05:20:28,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 05:20:28,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 05:20:28,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 05:20:28,724 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 05:20:28,726 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 05:20:28,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 05:20:28,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 05:20:28,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 05:20:28,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 05:20:28,745 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 05:20:28,748 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 05:20:28,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 05:20:28,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 05:20:28,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 05:20:28,759 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 05:20:28,759 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 05:20:28,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 05:20:28,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 05:20:28,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 05:20:28,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 05:20:28,765 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 05:20:28,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 05:20:28,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 05:20:28,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 05:20:28,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 05:20:28,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 05:20:28,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 05:20:28,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 05:20:28,774 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 05:20:28,775 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 05:20:28,776 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 05:20:28,777 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-19 05:20:28,821 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 05:20:28,822 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 05:20:28,832 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-19 05:20:28,833 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-19 05:20:28,834 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 05:20:28,835 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 05:20:28,835 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-19 05:20:28,836 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-19 05:20:28,836 INFO L138 SettingsManager]: * Use SBE=true [2021-11-19 05:20:28,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 05:20:28,837 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 05:20:28,838 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-19 05:20:28,838 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 05:20:28,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 05:20:28,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 05:20:28,839 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 05:20:28,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 05:20:28,839 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 05:20:28,839 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 05:20:28,840 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 05:20:28,840 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 05:20:28,840 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 05:20:28,841 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-19 05:20:28,841 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 05:20:28,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 05:20:28,841 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 05:20:28,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 05:20:28,842 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 05:20:28,842 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-19 05:20:28,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-19 05:20:28,843 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-19 05:20:28,843 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-19 05:20:28,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 05:20:28,844 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 05:20:28,844 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_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/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_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL 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 -> 0161797d3d47f58b7fc5d66ce82438765cea4779ac8884472a06ee6979f47801 [2021-11-19 05:20:29,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 05:20:29,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 05:20:29,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 05:20:29,164 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 05:20:29,165 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 05:20:29,167 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/../../sv-benchmarks/c/xcsp/Dubois-017.c [2021-11-19 05:20:29,239 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/data/7a6f46b1f/1ce2af00ddad45798e27adac1d79bcba/FLAG4c7f84fd0 [2021-11-19 05:20:29,897 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 05:20:29,898 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/sv-benchmarks/c/xcsp/Dubois-017.c [2021-11-19 05:20:29,920 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/data/7a6f46b1f/1ce2af00ddad45798e27adac1d79bcba/FLAG4c7f84fd0 [2021-11-19 05:20:30,175 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/data/7a6f46b1f/1ce2af00ddad45798e27adac1d79bcba [2021-11-19 05:20:30,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 05:20:30,181 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 05:20:30,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 05:20:30,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 05:20:30,187 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 05:20:30,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:20:30" (1/1) ... [2021-11-19 05:20:30,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2147da6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:30, skipping insertion in model container [2021-11-19 05:20:30,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:20:30" (1/1) ... [2021-11-19 05:20:30,207 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 05:20:30,277 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 05:20:30,607 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_ddc1c764-c207-426b-82df-c93466d85557/sv-benchmarks/c/xcsp/Dubois-017.c[12348,12361] [2021-11-19 05:20:30,616 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 05:20:30,624 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 05:20:30,757 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_ddc1c764-c207-426b-82df-c93466d85557/sv-benchmarks/c/xcsp/Dubois-017.c[12348,12361] [2021-11-19 05:20:30,760 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 05:20:30,783 INFO L208 MainTranslator]: Completed translation [2021-11-19 05:20:30,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:30 WrapperNode [2021-11-19 05:20:30,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 05:20:30,791 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 05:20:30,791 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 05:20:30,791 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 05:20:30,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:30" (1/1) ... [2021-11-19 05:20:30,820 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:30" (1/1) ... [2021-11-19 05:20:30,877 INFO L137 Inliner]: procedures = 13, calls = 143, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 357 [2021-11-19 05:20:30,877 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 05:20:30,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 05:20:30,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 05:20:30,878 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 05:20:30,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:30" (1/1) ... [2021-11-19 05:20:30,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:30" (1/1) ... [2021-11-19 05:20:30,894 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:30" (1/1) ... [2021-11-19 05:20:30,894 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:30" (1/1) ... [2021-11-19 05:20:30,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:30" (1/1) ... [2021-11-19 05:20:30,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:30" (1/1) ... [2021-11-19 05:20:30,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:30" (1/1) ... [2021-11-19 05:20:30,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 05:20:30,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 05:20:30,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 05:20:30,944 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 05:20:30,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:30" (1/1) ... [2021-11-19 05:20:30,953 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 05:20:30,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 05:20:30,979 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 05:20:31,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 05:20:31,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 05:20:31,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 05:20:31,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 05:20:31,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-19 05:20:31,028 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2021-11-19 05:20:31,028 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2021-11-19 05:20:31,150 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 05:20:31,151 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 05:20:31,631 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 05:20:31,644 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 05:20:31,644 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-19 05:20:31,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:20:31 BoogieIcfgContainer [2021-11-19 05:20:31,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 05:20:31,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 05:20:31,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 05:20:31,652 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 05:20:31,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:20:30" (1/3) ... [2021-11-19 05:20:31,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@952f1f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:20:31, skipping insertion in model container [2021-11-19 05:20:31,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:30" (2/3) ... [2021-11-19 05:20:31,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@952f1f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:20:31, skipping insertion in model container [2021-11-19 05:20:31,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:20:31" (3/3) ... [2021-11-19 05:20:31,655 INFO L111 eAbstractionObserver]: Analyzing ICFG Dubois-017.c [2021-11-19 05:20:31,661 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 05:20:31,661 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-19 05:20:31,721 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 05:20:31,733 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-11-19 05:20:31,733 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-19 05:20:31,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 136 states have call successors, (136), 1 states have call predecessors, (136), 1 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2021-11-19 05:20:31,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2021-11-19 05:20:31,842 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 05:20:31,843 INFO L514 BasicCegarLoop]: trace histogram [136, 136, 136, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 05:20:31,844 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 05:20:31,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:20:31,850 INFO L85 PathProgramCache]: Analyzing trace with hash 614162225, now seen corresponding path program 1 times [2021-11-19 05:20:31,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:20:31,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491132997] [2021-11-19 05:20:31,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:20:31,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:20:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-19 05:20:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-19 05:20:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-11-19 05:20:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-19 05:20:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-19 05:20:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-19 05:20:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-19 05:20:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-19 05:20:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-19 05:20:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-19 05:20:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-19 05:20:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-19 05:20:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-19 05:20:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-19 05:20:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-19 05:20:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-19 05:20:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-19 05:20:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-19 05:20:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-11-19 05:20:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-19 05:20:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-19 05:20:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-19 05:20:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-19 05:20:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-11-19 05:20:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2021-11-19 05:20:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-19 05:20:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-11-19 05:20:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-11-19 05:20:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-11-19 05:20:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-11-19 05:20:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-11-19 05:20:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2021-11-19 05:20:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-11-19 05:20:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2021-11-19 05:20:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2021-11-19 05:20:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2021-11-19 05:20:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-11-19 05:20:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2021-11-19 05:20:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2021-11-19 05:20:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-19 05:20:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2021-11-19 05:20:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2021-11-19 05:20:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2021-11-19 05:20:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-11-19 05:20:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-11-19 05:20:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2021-11-19 05:20:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-11-19 05:20:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2021-11-19 05:20:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-11-19 05:20:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-11-19 05:20:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-11-19 05:20:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-19 05:20:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-11-19 05:20:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-11-19 05:20:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2021-11-19 05:20:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-11-19 05:20:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-11-19 05:20:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-11-19 05:20:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2021-11-19 05:20:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2021-11-19 05:20:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2021-11-19 05:20:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2021-11-19 05:20:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2021-11-19 05:20:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2021-11-19 05:20:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2021-11-19 05:20:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2021-11-19 05:20:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2021-11-19 05:20:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2021-11-19 05:20:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-11-19 05:20:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2021-11-19 05:20:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2021-11-19 05:20:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2021-11-19 05:20:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 398 [2021-11-19 05:20:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 403 [2021-11-19 05:20:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 409 [2021-11-19 05:20:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2021-11-19 05:20:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 420 [2021-11-19 05:20:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 425 [2021-11-19 05:20:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 431 [2021-11-19 05:20:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 436 [2021-11-19 05:20:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-11-19 05:20:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 447 [2021-11-19 05:20:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 453 [2021-11-19 05:20:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 458 [2021-11-19 05:20:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 464 [2021-11-19 05:20:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 469 [2021-11-19 05:20:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 475 [2021-11-19 05:20:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 480 [2021-11-19 05:20:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 486 [2021-11-19 05:20:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491 [2021-11-19 05:20:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 497 [2021-11-19 05:20:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 502 [2021-11-19 05:20:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 508 [2021-11-19 05:20:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:32,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-11-19 05:20:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 519 [2021-11-19 05:20:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 524 [2021-11-19 05:20:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 530 [2021-11-19 05:20:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 535 [2021-11-19 05:20:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 541 [2021-11-19 05:20:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 546 [2021-11-19 05:20:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 552 [2021-11-19 05:20:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 557 [2021-11-19 05:20:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 563 [2021-11-19 05:20:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 568 [2021-11-19 05:20:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 573 [2021-11-19 05:20:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 578 [2021-11-19 05:20:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 583 [2021-11-19 05:20:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 588 [2021-11-19 05:20:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 593 [2021-11-19 05:20:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 598 [2021-11-19 05:20:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 603 [2021-11-19 05:20:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 608 [2021-11-19 05:20:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 613 [2021-11-19 05:20:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 618 [2021-11-19 05:20:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 623 [2021-11-19 05:20:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 628 [2021-11-19 05:20:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 633 [2021-11-19 05:20:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 638 [2021-11-19 05:20:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 643 [2021-11-19 05:20:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 648 [2021-11-19 05:20:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 653 [2021-11-19 05:20:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 658 [2021-11-19 05:20:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 663 [2021-11-19 05:20:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 668 [2021-11-19 05:20:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 673 [2021-11-19 05:20:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 678 [2021-11-19 05:20:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 683 [2021-11-19 05:20:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 688 [2021-11-19 05:20:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 693 [2021-11-19 05:20:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 698 [2021-11-19 05:20:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 703 [2021-11-19 05:20:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 708 [2021-11-19 05:20:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 713 [2021-11-19 05:20:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 718 [2021-11-19 05:20:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 723 [2021-11-19 05:20:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 728 [2021-11-19 05:20:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:33,357 INFO L134 CoverageAnalysis]: Checked inductivity of 36720 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36720 trivial. 0 not checked. [2021-11-19 05:20:33,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-19 05:20:33,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491132997] [2021-11-19 05:20:33,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491132997] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 05:20:33,359 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 05:20:33,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-19 05:20:33,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646192535] [2021-11-19 05:20:33,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:20:33,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-19 05:20:33,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-19 05:20:33,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-19 05:20:33,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-19 05:20:33,420 INFO L87 Difference]: Start difference. First operand has 198 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 136 states have call successors, (136), 1 states have call predecessors, (136), 1 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (136), 1 states have call predecessors, (136), 1 states have return successors, (136), 1 states have call predecessors, (136), 2 states have call successors, (136) [2021-11-19 05:20:33,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:20:33,545 INFO L93 Difference]: Finished difference Result 390 states and 796 transitions. [2021-11-19 05:20:33,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-19 05:20:33,551 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (136), 1 states have call predecessors, (136), 1 states have return successors, (136), 1 states have call predecessors, (136), 2 states have call successors, (136) Word has length 734 [2021-11-19 05:20:33,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 05:20:33,569 INFO L225 Difference]: With dead ends: 390 [2021-11-19 05:20:33,569 INFO L226 Difference]: Without dead ends: 195 [2021-11-19 05:20:33,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 410 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-11-19 05:20:33,589 INFO L933 BasicCegarLoop]: 329 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, 329 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-11-19 05:20:33,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 05:20:33,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-11-19 05:20:33,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-11-19 05:20:33,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 57 states have (on average 1.0) internal successors, (57), 57 states have internal predecessors, (57), 136 states have call successors, (136), 1 states have call predecessors, (136), 1 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2021-11-19 05:20:33,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 329 transitions. [2021-11-19 05:20:33,747 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 329 transitions. Word has length 734 [2021-11-19 05:20:33,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 05:20:33,749 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 329 transitions. [2021-11-19 05:20:33,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (136), 1 states have call predecessors, (136), 1 states have return successors, (136), 1 states have call predecessors, (136), 2 states have call successors, (136) [2021-11-19 05:20:33,750 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 329 transitions. [2021-11-19 05:20:33,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2021-11-19 05:20:33,790 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 05:20:33,791 INFO L514 BasicCegarLoop]: trace histogram [136, 136, 136, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 05:20:33,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-19 05:20:33,792 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 05:20:33,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:20:33,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1555864369, now seen corresponding path program 1 times [2021-11-19 05:20:33,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-19 05:20:33,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401457373] [2021-11-19 05:20:33,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:20:33,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 05:20:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:20:34,263 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-19 05:20:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-19 05:20:34,759 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-19 05:20:34,759 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-19 05:20:34,762 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-19 05:20:34,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-19 05:20:34,768 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-19 05:20:34,773 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-19 05:20:35,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:20:35 BoogieIcfgContainer [2021-11-19 05:20:35,062 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-19 05:20:35,063 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-19 05:20:35,063 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-19 05:20:35,064 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-19 05:20:35,064 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:20:31" (3/4) ... [2021-11-19 05:20:35,068 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-19 05:20:35,069 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-19 05:20:35,072 INFO L158 Benchmark]: Toolchain (without parser) took 4890.80ms. Allocated memory was 94.4MB in the beginning and 155.2MB in the end (delta: 60.8MB). Free memory was 52.5MB in the beginning and 82.5MB in the end (delta: -30.0MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2021-11-19 05:20:35,073 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 94.4MB. Free memory is still 69.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 05:20:35,075 INFO L158 Benchmark]: CACSL2BoogieTranslator took 607.15ms. Allocated memory is still 94.4MB. Free memory was 52.3MB in the beginning and 55.6MB in the end (delta: -3.3MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2021-11-19 05:20:35,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.56ms. Allocated memory is still 94.4MB. Free memory was 55.6MB in the beginning and 50.5MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-19 05:20:35,082 INFO L158 Benchmark]: Boogie Preprocessor took 49.03ms. Allocated memory is still 94.4MB. Free memory was 50.5MB in the beginning and 47.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-19 05:20:35,083 INFO L158 Benchmark]: RCFGBuilder took 718.51ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 47.7MB in the beginning and 78.9MB in the end (delta: -31.2MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2021-11-19 05:20:35,084 INFO L158 Benchmark]: TraceAbstraction took 3414.42ms. Allocated memory was 113.2MB in the beginning and 155.2MB in the end (delta: 41.9MB). Free memory was 78.3MB in the beginning and 82.5MB in the end (delta: -4.2MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. [2021-11-19 05:20:35,084 INFO L158 Benchmark]: Witness Printer took 8.05ms. Allocated memory is still 155.2MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-19 05:20:35,092 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.31ms. Allocated memory is still 94.4MB. Free memory is still 69.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 607.15ms. Allocated memory is still 94.4MB. Free memory was 52.3MB in the beginning and 55.6MB in the end (delta: -3.3MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.56ms. Allocated memory is still 94.4MB. Free memory was 55.6MB in the beginning and 50.5MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.03ms. Allocated memory is still 94.4MB. Free memory was 50.5MB in the beginning and 47.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 718.51ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 47.7MB in the beginning and 78.9MB in the end (delta: -31.2MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3414.42ms. Allocated memory was 113.2MB in the beginning and 155.2MB in the end (delta: 41.9MB). Free memory was 78.3MB in the beginning and 82.5MB in the end (delta: -4.2MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. * Witness Printer took 8.05ms. Allocated memory is still 155.2MB. Free memory is still 82.5MB. 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: 366]: 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 362. 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=1] [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=1] [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=1, var1=1] [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=1, var1=1] [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=1, var1=1, 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=1, var1=1, 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=1, var1=1, var2=1, var3=1] [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=1, var1=1, var2=1, var3=1] [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=1, var1=1, var2=1, var3=1, var4=0] [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=1, var1=1, var2=1, var3=1, var4=0] [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=1, var1=1, var2=1, var3=1, var4=0, var5=1] [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=1, var1=1, var2=1, var3=1, var4=0, var5=1] [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=1, var1=1, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var5=1, 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=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var5=1, var6=0, var7=1, var8=1, var9=0] [L205] int var45; [L206] var45 = __VERIFIER_nondet_int() [L207] CALL assume(var45 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L207] RET assume(var45 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var5=1, var6=0, var7=1, var8=1, var9=0] [L208] CALL assume(var45 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L208] RET assume(var45 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var5=1, var6=0, var7=1, var8=1, var9=0] [L209] int var46; [L210] var46 = __VERIFIER_nondet_int() [L211] CALL assume(var46 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L211] RET assume(var46 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var5=1, var6=0, var7=1, var8=1, var9=0] [L212] CALL assume(var46 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L212] RET assume(var46 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var5=1, var6=0, var7=1, var8=1, var9=0] [L213] int var47; [L214] var47 = __VERIFIER_nondet_int() [L215] CALL assume(var47 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L215] RET assume(var47 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var5=1, var6=0, var7=1, var8=1, var9=0] [L216] CALL assume(var47 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L216] RET assume(var47 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var5=1, var6=0, var7=1, var8=1, var9=0] [L217] int var48; [L218] var48 = __VERIFIER_nondet_int() [L219] CALL assume(var48 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L219] RET assume(var48 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var5=1, var6=0, var7=1, var8=1, var9=0] [L220] CALL assume(var48 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L220] RET assume(var48 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var5=1, var6=0, var7=1, var8=1, var9=0] [L221] int var49; [L222] var49 = __VERIFIER_nondet_int() [L223] CALL assume(var49 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L223] RET assume(var49 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var6=0, var7=1, var8=1, var9=0] [L224] CALL assume(var49 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L224] RET assume(var49 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var6=0, var7=1, var8=1, var9=0] [L225] int var50; [L226] var50 = __VERIFIER_nondet_int() [L227] CALL assume(var50 >= 0) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L227] RET assume(var50 >= 0) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L228] CALL assume(var50 <= 1) VAL [\old(cond)=1] [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L228] RET assume(var50 <= 1) VAL [dummy=0, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L229] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L230-L233] CALL assume((var32 == 0 & var33 == 0 & var0 == 1) | (var32 == 0 & var33 == 1 & var0 == 0) | (var32 == 1 & var33 == 0 & var0 == 0) | (var32 == 1 & var33 == 1 & var0 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=62, cond=62] [L230-L233] RET assume((var32 == 0 & var33 == 0 & var0 == 1) | (var32 == 0 & var33 == 1 & var0 == 0) | (var32 == 1 & var33 == 0 & var0 == 0) | (var32 == 1 & var33 == 1 & var0 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L234-L237] CALL assume((var1 == 0 & var35 == 0 & var2 == 1) | (var1 == 0 & var35 == 1 & var2 == 0) | (var1 == 1 & var35 == 0 & var2 == 0) | (var1 == 1 & var35 == 1 & var2 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=79, cond=79] [L234-L237] RET assume((var1 == 0 & var35 == 0 & var2 == 1) | (var1 == 0 & var35 == 1 & var2 == 0) | (var1 == 1 & var35 == 0 & var2 == 0) | (var1 == 1 & var35 == 1 & var2 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L238-L241] CALL assume((var2 == 0 & var36 == 0 & var3 == 1) | (var2 == 0 & var36 == 1 & var3 == 0) | (var2 == 1 & var36 == 0 & var3 == 0) | (var2 == 1 & var36 == 1 & var3 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=61, cond=61] [L238-L241] RET assume((var2 == 0 & var36 == 0 & var3 == 1) | (var2 == 0 & var36 == 1 & var3 == 0) | (var2 == 1 & var36 == 0 & var3 == 0) | (var2 == 1 & var36 == 1 & var3 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L242-L245] CALL assume((var3 == 0 & var37 == 0 & var4 == 1) | (var3 == 0 & var37 == 1 & var4 == 0) | (var3 == 1 & var37 == 0 & var4 == 0) | (var3 == 1 & var37 == 1 & var4 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=69, cond=69] [L242-L245] RET assume((var3 == 0 & var37 == 0 & var4 == 1) | (var3 == 0 & var37 == 1 & var4 == 0) | (var3 == 1 & var37 == 0 & var4 == 0) | (var3 == 1 & var37 == 1 & var4 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L246-L249] CALL assume((var4 == 0 & var38 == 0 & var5 == 1) | (var4 == 0 & var38 == 1 & var5 == 0) | (var4 == 1 & var38 == 0 & var5 == 0) | (var4 == 1 & var38 == 1 & var5 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=72, cond=72] [L246-L249] RET assume((var4 == 0 & var38 == 0 & var5 == 1) | (var4 == 0 & var38 == 1 & var5 == 0) | (var4 == 1 & var38 == 0 & var5 == 0) | (var4 == 1 & var38 == 1 & var5 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L250-L253] CALL assume((var5 == 0 & var39 == 0 & var6 == 1) | (var5 == 0 & var39 == 1 & var6 == 0) | (var5 == 1 & var39 == 0 & var6 == 0) | (var5 == 1 & var39 == 1 & var6 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=70, cond=70] [L250-L253] RET assume((var5 == 0 & var39 == 0 & var6 == 1) | (var5 == 0 & var39 == 1 & var6 == 0) | (var5 == 1 & var39 == 0 & var6 == 0) | (var5 == 1 & var39 == 1 & var6 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L254-L257] CALL assume((var6 == 0 & var40 == 0 & var7 == 1) | (var6 == 0 & var40 == 1 & var7 == 0) | (var6 == 1 & var40 == 0 & var7 == 0) | (var6 == 1 & var40 == 1 & var7 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=65, cond=65] [L254-L257] RET assume((var6 == 0 & var40 == 0 & var7 == 1) | (var6 == 0 & var40 == 1 & var7 == 0) | (var6 == 1 & var40 == 0 & var7 == 0) | (var6 == 1 & var40 == 1 & var7 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L258-L261] CALL assume((var7 == 0 & var41 == 0 & var8 == 1) | (var7 == 0 & var41 == 1 & var8 == 0) | (var7 == 1 & var41 == 0 & var8 == 0) | (var7 == 1 & var41 == 1 & var8 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=80, cond=80] [L258-L261] RET assume((var7 == 0 & var41 == 0 & var8 == 1) | (var7 == 0 & var41 == 1 & var8 == 0) | (var7 == 1 & var41 == 0 & var8 == 0) | (var7 == 1 & var41 == 1 & var8 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L262-L265] CALL assume((var8 == 0 & var42 == 0 & var9 == 1) | (var8 == 0 & var42 == 1 & var9 == 0) | (var8 == 1 & var42 == 0 & var9 == 0) | (var8 == 1 & var42 == 1 & var9 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=52, cond=52] [L262-L265] RET assume((var8 == 0 & var42 == 0 & var9 == 1) | (var8 == 0 & var42 == 1 & var9 == 0) | (var8 == 1 & var42 == 0 & var9 == 0) | (var8 == 1 & var42 == 1 & var9 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L266-L269] CALL assume((var9 == 0 & var43 == 0 & var10 == 1) | (var9 == 0 & var43 == 1 & var10 == 0) | (var9 == 1 & var43 == 0 & var10 == 0) | (var9 == 1 & var43 == 1 & var10 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=57, cond=57] [L266-L269] RET assume((var9 == 0 & var43 == 0 & var10 == 1) | (var9 == 0 & var43 == 1 & var10 == 0) | (var9 == 1 & var43 == 0 & var10 == 0) | (var9 == 1 & var43 == 1 & var10 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L270-L273] CALL assume((var10 == 0 & var44 == 0 & var11 == 1) | (var10 == 0 & var44 == 1 & var11 == 0) | (var10 == 1 & var44 == 0 & var11 == 0) | (var10 == 1 & var44 == 1 & var11 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=73, cond=73] [L270-L273] RET assume((var10 == 0 & var44 == 0 & var11 == 1) | (var10 == 0 & var44 == 1 & var11 == 0) | (var10 == 1 & var44 == 0 & var11 == 0) | (var10 == 1 & var44 == 1 & var11 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L274-L277] CALL assume((var11 == 0 & var45 == 0 & var12 == 1) | (var11 == 0 & var45 == 1 & var12 == 0) | (var11 == 1 & var45 == 0 & var12 == 0) | (var11 == 1 & var45 == 1 & var12 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=71, cond=71] [L274-L277] RET assume((var11 == 0 & var45 == 0 & var12 == 1) | (var11 == 0 & var45 == 1 & var12 == 0) | (var11 == 1 & var45 == 0 & var12 == 0) | (var11 == 1 & var45 == 1 & var12 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L278-L281] CALL assume((var12 == 0 & var46 == 0 & var13 == 1) | (var12 == 0 & var46 == 1 & var13 == 0) | (var12 == 1 & var46 == 0 & var13 == 0) | (var12 == 1 & var46 == 1 & var13 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=63, cond=63] [L278-L281] RET assume((var12 == 0 & var46 == 0 & var13 == 1) | (var12 == 0 & var46 == 1 & var13 == 0) | (var12 == 1 & var46 == 0 & var13 == 0) | (var12 == 1 & var46 == 1 & var13 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L282-L285] CALL assume((var13 == 0 & var47 == 0 & var14 == 1) | (var13 == 0 & var47 == 1 & var14 == 0) | (var13 == 1 & var47 == 0 & var14 == 0) | (var13 == 1 & var47 == 1 & var14 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=76, cond=76] [L282-L285] RET assume((var13 == 0 & var47 == 0 & var14 == 1) | (var13 == 0 & var47 == 1 & var14 == 0) | (var13 == 1 & var47 == 0 & var14 == 0) | (var13 == 1 & var47 == 1 & var14 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L286-L289] CALL assume((var14 == 0 & var48 == 0 & var15 == 1) | (var14 == 0 & var48 == 1 & var15 == 0) | (var14 == 1 & var48 == 0 & var15 == 0) | (var14 == 1 & var48 == 1 & var15 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=74, cond=74] [L286-L289] RET assume((var14 == 0 & var48 == 0 & var15 == 1) | (var14 == 0 & var48 == 1 & var15 == 0) | (var14 == 1 & var48 == 0 & var15 == 0) | (var14 == 1 & var48 == 1 & var15 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L290-L293] CALL assume((var0 == 0 & var34 == 0 & var1 == 1) | (var0 == 0 & var34 == 1 & var1 == 0) | (var0 == 1 & var34 == 0 & var1 == 0) | (var0 == 1 & var34 == 1 & var1 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=67, cond=67] [L290-L293] RET assume((var0 == 0 & var34 == 0 & var1 == 1) | (var0 == 0 & var34 == 1 & var1 == 0) | (var0 == 1 & var34 == 0 & var1 == 0) | (var0 == 1 & var34 == 1 & var1 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L294-L297] CALL assume((var16 == 0 & var49 == 0 & var50 == 1) | (var16 == 0 & var49 == 1 & var50 == 0) | (var16 == 1 & var49 == 0 & var50 == 0) | (var16 == 1 & var49 == 1 & var50 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=75, cond=75] [L294-L297] RET assume((var16 == 0 & var49 == 0 & var50 == 1) | (var16 == 0 & var49 == 1 & var50 == 0) | (var16 == 1 & var49 == 0 & var50 == 0) | (var16 == 1 & var49 == 1 & var50 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L298-L301] CALL assume((var15 == 0 & var49 == 0 & var50 == 1) | (var15 == 0 & var49 == 1 & var50 == 0) | (var15 == 1 & var49 == 0 & var50 == 0) | (var15 == 1 & var49 == 1 & var50 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=64, cond=64] [L298-L301] RET assume((var15 == 0 & var49 == 0 & var50 == 1) | (var15 == 0 & var49 == 1 & var50 == 0) | (var15 == 1 & var49 == 0 & var50 == 0) | (var15 == 1 & var49 == 1 & var50 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L302-L305] CALL assume((var18 == 0 & var47 == 0 & var17 == 1) | (var18 == 0 & var47 == 1 & var17 == 0) | (var18 == 1 & var47 == 0 & var17 == 0) | (var18 == 1 & var47 == 1 & var17 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=81, cond=81] [L302-L305] RET assume((var18 == 0 & var47 == 0 & var17 == 1) | (var18 == 0 & var47 == 1 & var17 == 0) | (var18 == 1 & var47 == 0 & var17 == 0) | (var18 == 1 & var47 == 1 & var17 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L306-L309] CALL assume((var19 == 0 & var46 == 0 & var18 == 1) | (var19 == 0 & var46 == 1 & var18 == 0) | (var19 == 1 & var46 == 0 & var18 == 0) | (var19 == 1 & var46 == 1 & var18 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=66, cond=66] [L306-L309] RET assume((var19 == 0 & var46 == 0 & var18 == 1) | (var19 == 0 & var46 == 1 & var18 == 0) | (var19 == 1 & var46 == 0 & var18 == 0) | (var19 == 1 & var46 == 1 & var18 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L310-L313] CALL assume((var20 == 0 & var45 == 0 & var19 == 1) | (var20 == 0 & var45 == 1 & var19 == 0) | (var20 == 1 & var45 == 0 & var19 == 0) | (var20 == 1 & var45 == 1 & var19 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=77, cond=77] [L310-L313] RET assume((var20 == 0 & var45 == 0 & var19 == 1) | (var20 == 0 & var45 == 1 & var19 == 0) | (var20 == 1 & var45 == 0 & var19 == 0) | (var20 == 1 & var45 == 1 & var19 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L314-L317] CALL assume((var21 == 0 & var44 == 0 & var20 == 1) | (var21 == 0 & var44 == 1 & var20 == 0) | (var21 == 1 & var44 == 0 & var20 == 0) | (var21 == 1 & var44 == 1 & var20 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=82, cond=82] [L314-L317] RET assume((var21 == 0 & var44 == 0 & var20 == 1) | (var21 == 0 & var44 == 1 & var20 == 0) | (var21 == 1 & var44 == 0 & var20 == 0) | (var21 == 1 & var44 == 1 & var20 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L318-L321] CALL assume((var22 == 0 & var43 == 0 & var21 == 1) | (var22 == 0 & var43 == 1 & var21 == 0) | (var22 == 1 & var43 == 0 & var21 == 0) | (var22 == 1 & var43 == 1 & var21 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=49, cond=49] [L318-L321] RET assume((var22 == 0 & var43 == 0 & var21 == 1) | (var22 == 0 & var43 == 1 & var21 == 0) | (var22 == 1 & var43 == 0 & var21 == 0) | (var22 == 1 & var43 == 1 & var21 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L322-L325] CALL assume((var23 == 0 & var42 == 0 & var22 == 1) | (var23 == 0 & var42 == 1 & var22 == 0) | (var23 == 1 & var42 == 0 & var22 == 0) | (var23 == 1 & var42 == 1 & var22 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=50, cond=50] [L322-L325] RET assume((var23 == 0 & var42 == 0 & var22 == 1) | (var23 == 0 & var42 == 1 & var22 == 0) | (var23 == 1 & var42 == 0 & var22 == 0) | (var23 == 1 & var42 == 1 & var22 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L326-L329] CALL assume((var24 == 0 & var41 == 0 & var23 == 1) | (var24 == 0 & var41 == 1 & var23 == 0) | (var24 == 1 & var41 == 0 & var23 == 0) | (var24 == 1 & var41 == 1 & var23 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=51, cond=51] [L326-L329] RET assume((var24 == 0 & var41 == 0 & var23 == 1) | (var24 == 0 & var41 == 1 & var23 == 0) | (var24 == 1 & var41 == 0 & var23 == 0) | (var24 == 1 & var41 == 1 & var23 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L330-L333] CALL assume((var25 == 0 & var40 == 0 & var24 == 1) | (var25 == 0 & var40 == 1 & var24 == 0) | (var25 == 1 & var40 == 0 & var24 == 0) | (var25 == 1 & var40 == 1 & var24 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=55, cond=55] [L330-L333] RET assume((var25 == 0 & var40 == 0 & var24 == 1) | (var25 == 0 & var40 == 1 & var24 == 0) | (var25 == 1 & var40 == 0 & var24 == 0) | (var25 == 1 & var40 == 1 & var24 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L334-L337] CALL assume((var26 == 0 & var39 == 0 & var25 == 1) | (var26 == 0 & var39 == 1 & var25 == 0) | (var26 == 1 & var39 == 0 & var25 == 0) | (var26 == 1 & var39 == 1 & var25 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=58, cond=58] [L334-L337] RET assume((var26 == 0 & var39 == 0 & var25 == 1) | (var26 == 0 & var39 == 1 & var25 == 0) | (var26 == 1 & var39 == 0 & var25 == 0) | (var26 == 1 & var39 == 1 & var25 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L338-L341] CALL assume((var27 == 0 & var38 == 0 & var26 == 1) | (var27 == 0 & var38 == 1 & var26 == 0) | (var27 == 1 & var38 == 0 & var26 == 0) | (var27 == 1 & var38 == 1 & var26 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=53, cond=53] [L338-L341] RET assume((var27 == 0 & var38 == 0 & var26 == 1) | (var27 == 0 & var38 == 1 & var26 == 0) | (var27 == 1 & var38 == 0 & var26 == 0) | (var27 == 1 & var38 == 1 & var26 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L342-L345] CALL assume((var28 == 0 & var37 == 0 & var27 == 1) | (var28 == 0 & var37 == 1 & var27 == 0) | (var28 == 1 & var37 == 0 & var27 == 0) | (var28 == 1 & var37 == 1 & var27 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=54, cond=54] [L342-L345] RET assume((var28 == 0 & var37 == 0 & var27 == 1) | (var28 == 0 & var37 == 1 & var27 == 0) | (var28 == 1 & var37 == 0 & var27 == 0) | (var28 == 1 & var37 == 1 & var27 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L346-L349] CALL assume((var29 == 0 & var36 == 0 & var28 == 1) | (var29 == 0 & var36 == 1 & var28 == 0) | (var29 == 1 & var36 == 0 & var28 == 0) | (var29 == 1 & var36 == 1 & var28 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=56, cond=56] [L346-L349] RET assume((var29 == 0 & var36 == 0 & var28 == 1) | (var29 == 0 & var36 == 1 & var28 == 0) | (var29 == 1 & var36 == 0 & var28 == 0) | (var29 == 1 & var36 == 1 & var28 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L350-L353] CALL assume((var30 == 0 & var35 == 0 & var29 == 1) | (var30 == 0 & var35 == 1 & var29 == 0) | (var30 == 1 & var35 == 0 & var29 == 0) | (var30 == 1 & var35 == 1 & var29 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=68, cond=68] [L350-L353] RET assume((var30 == 0 & var35 == 0 & var29 == 1) | (var30 == 0 & var35 == 1 & var29 == 0) | (var30 == 1 & var35 == 0 & var29 == 0) | (var30 == 1 & var35 == 1 & var29 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L354-L357] CALL assume((var31 == 0 & var34 == 0 & var30 == 1) | (var31 == 0 & var34 == 1 & var30 == 0) | (var31 == 1 & var34 == 0 & var30 == 0) | (var31 == 1 & var34 == 1 & var30 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=59, cond=59] [L354-L357] RET assume((var31 == 0 & var34 == 0 & var30 == 1) | (var31 == 0 & var34 == 1 & var30 == 0) | (var31 == 1 & var34 == 0 & var30 == 0) | (var31 == 1 & var34 == 1 & var30 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L358-L361] CALL assume((var17 == 0 & var48 == 0 & var16 == 1) | (var17 == 0 & var48 == 1 & var16 == 0) | (var17 == 1 & var48 == 0 & var16 == 0) | (var17 == 1 & var48 == 1 & var16 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=60, cond=60] [L358-L361] RET assume((var17 == 0 & var48 == 0 & var16 == 1) | (var17 == 0 & var48 == 1 & var16 == 0) | (var17 == 1 & var48 == 0 & var16 == 0) | (var17 == 1 & var48 == 1 & var16 == 1) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L362-L365] CALL assume((var32 == 0 & var33 == 0 & var31 == 0) | (var32 == 0 & var33 == 1 & var31 == 1) | (var32 == 1 & var33 == 0 & var31 == 1) | (var32 == 1 & var33 == 1 & var31 == 0) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=78, cond=78] [L362-L365] RET assume((var32 == 0 & var33 == 0 & var31 == 0) | (var32 == 0 & var33 == 1 & var31 == 1) | (var32 == 1 & var33 == 0 & var31 == 1) | (var32 == 1 & var33 == 1 & var31 == 0) | 0) VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] [L366] reach_error() VAL [dummy=0, myvar0=1, var0=1, var1=1, var10=0, var11=1, var12=1, var13=1, var14=1, var15=0, var16=1, var17=1, var18=0, var19=0, var2=1, var20=1, var21=1, var22=1, var23=1, var24=1, var25=0, var26=1, var27=0, var28=0, var29=1, var3=1, var30=0, var31=1, var32=0, var33=1, var34=1, var35=1, var36=1, var37=0, var38=0, var39=1, var4=0, var40=1, var41=1, var42=1, var43=0, var44=1, var45=0, var46=1, var47=1, var48=1, var49=1, var5=1, var50=0, var6=0, var7=1, var8=1, var9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 2, TraceHistogramMax: 136, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.2s, 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, 329 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, 329 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 410 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1468 NumberOfCodeBlocks, 1468 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 733 ConstructedInterpolants, 0 QuantifiedInterpolants, 733 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 36720/36720 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-11-19 05:20:35,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/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_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/config/AutomizerReach.xml -i ../../sv-benchmarks/c/xcsp/Dubois-017.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL --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 0161797d3d47f58b7fc5d66ce82438765cea4779ac8884472a06ee6979f47801 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 05:20:37,699 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 05:20:37,701 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 05:20:37,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 05:20:37,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 05:20:37,762 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 05:20:37,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 05:20:37,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 05:20:37,776 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 05:20:37,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 05:20:37,784 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 05:20:37,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 05:20:37,787 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 05:20:37,790 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 05:20:37,793 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 05:20:37,798 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 05:20:37,800 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 05:20:37,802 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 05:20:37,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 05:20:37,815 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 05:20:37,817 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 05:20:37,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 05:20:37,821 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 05:20:37,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 05:20:37,833 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 05:20:37,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 05:20:37,834 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 05:20:37,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 05:20:37,837 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 05:20:37,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 05:20:37,839 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 05:20:37,840 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 05:20:37,842 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 05:20:37,843 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 05:20:37,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 05:20:37,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 05:20:37,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 05:20:37,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 05:20:37,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 05:20:37,850 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 05:20:37,850 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 05:20:37,851 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-11-19 05:20:37,920 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 05:20:37,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 05:20:37,921 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-19 05:20:37,921 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-19 05:20:37,922 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 05:20:37,923 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 05:20:37,924 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-19 05:20:37,924 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-19 05:20:37,924 INFO L138 SettingsManager]: * Use SBE=true [2021-11-19 05:20:37,925 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 05:20:37,926 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 05:20:37,926 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 05:20:37,926 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 05:20:37,927 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 05:20:37,927 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 05:20:37,927 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 05:20:37,928 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-19 05:20:37,928 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-19 05:20:37,928 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 05:20:37,928 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 05:20:37,928 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 05:20:37,929 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 05:20:37,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 05:20:37,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-19 05:20:37,929 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 05:20:37,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 05:20:37,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 05:20:37,931 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 05:20:37,931 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 05:20:37,931 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-19 05:20:37,931 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-19 05:20:37,931 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-19 05:20:37,932 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-19 05:20:37,932 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 05:20:37,932 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 05:20:37,933 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 05:20:37,933 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_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/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_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL 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 -> 0161797d3d47f58b7fc5d66ce82438765cea4779ac8884472a06ee6979f47801 [2021-11-19 05:20:38,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 05:20:38,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 05:20:38,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 05:20:38,415 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 05:20:38,416 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 05:20:38,417 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/../../sv-benchmarks/c/xcsp/Dubois-017.c [2021-11-19 05:20:38,497 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/data/a83ccf7a0/260a8fd14951415e8c2d42ea24d705e4/FLAG6d3093e90 [2021-11-19 05:20:39,112 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 05:20:39,115 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/sv-benchmarks/c/xcsp/Dubois-017.c [2021-11-19 05:20:39,131 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/data/a83ccf7a0/260a8fd14951415e8c2d42ea24d705e4/FLAG6d3093e90 [2021-11-19 05:20:39,389 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/data/a83ccf7a0/260a8fd14951415e8c2d42ea24d705e4 [2021-11-19 05:20:39,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 05:20:39,394 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 05:20:39,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 05:20:39,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 05:20:39,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 05:20:39,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:20:39" (1/1) ... [2021-11-19 05:20:39,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3923631d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:39, skipping insertion in model container [2021-11-19 05:20:39,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:20:39" (1/1) ... [2021-11-19 05:20:39,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 05:20:39,446 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 05:20:39,719 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_ddc1c764-c207-426b-82df-c93466d85557/sv-benchmarks/c/xcsp/Dubois-017.c[12348,12361] [2021-11-19 05:20:39,728 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 05:20:39,741 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 05:20:39,927 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_ddc1c764-c207-426b-82df-c93466d85557/sv-benchmarks/c/xcsp/Dubois-017.c[12348,12361] [2021-11-19 05:20:39,943 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 05:20:39,957 INFO L208 MainTranslator]: Completed translation [2021-11-19 05:20:39,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:39 WrapperNode [2021-11-19 05:20:39,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 05:20:39,959 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 05:20:39,959 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 05:20:39,960 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 05:20:39,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:39" (1/1) ... [2021-11-19 05:20:39,988 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:39" (1/1) ... [2021-11-19 05:20:40,042 INFO L137 Inliner]: procedures = 13, calls = 143, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 306 [2021-11-19 05:20:40,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 05:20:40,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 05:20:40,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 05:20:40,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 05:20:40,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:39" (1/1) ... [2021-11-19 05:20:40,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:39" (1/1) ... [2021-11-19 05:20:40,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:39" (1/1) ... [2021-11-19 05:20:40,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:39" (1/1) ... [2021-11-19 05:20:40,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:39" (1/1) ... [2021-11-19 05:20:40,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:39" (1/1) ... [2021-11-19 05:20:40,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:39" (1/1) ... [2021-11-19 05:20:40,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 05:20:40,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 05:20:40,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 05:20:40,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 05:20:40,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:39" (1/1) ... [2021-11-19 05:20:40,117 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 05:20:40,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/z3 [2021-11-19 05:20:40,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 05:20:40,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 05:20:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-19 05:20:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 05:20:40,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 05:20:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-19 05:20:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2021-11-19 05:20:40,229 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2021-11-19 05:20:40,400 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 05:20:40,401 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 05:20:40,887 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 05:20:40,910 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 05:20:40,911 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-19 05:20:40,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:20:40 BoogieIcfgContainer [2021-11-19 05:20:40,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 05:20:40,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 05:20:40,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 05:20:40,920 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 05:20:40,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:20:39" (1/3) ... [2021-11-19 05:20:40,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a92c7b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:20:40, skipping insertion in model container [2021-11-19 05:20:40,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:20:39" (2/3) ... [2021-11-19 05:20:40,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a92c7b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:20:40, skipping insertion in model container [2021-11-19 05:20:40,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:20:40" (3/3) ... [2021-11-19 05:20:40,924 INFO L111 eAbstractionObserver]: Analyzing ICFG Dubois-017.c [2021-11-19 05:20:40,934 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 05:20:40,935 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-19 05:20:41,011 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 05:20:41,020 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-11-19 05:20:41,021 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-19 05:20:41,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 136 states have call successors, (136), 1 states have call predecessors, (136), 1 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2021-11-19 05:20:41,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2021-11-19 05:20:41,158 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 05:20:41,160 INFO L514 BasicCegarLoop]: trace histogram [136, 136, 136, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 05:20:41,161 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 05:20:41,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:20:41,168 INFO L85 PathProgramCache]: Analyzing trace with hash 614162225, now seen corresponding path program 1 times [2021-11-19 05:20:41,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-19 05:20:41,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317455369] [2021-11-19 05:20:41,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:20:41,191 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 05:20:41,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/mathsat [2021-11-19 05:20:41,195 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 05:20:41,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-19 05:20:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:20:41,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-19 05:20:41,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 05:20:43,649 INFO L134 CoverageAnalysis]: Checked inductivity of 36720 backedges. 16814 proven. 0 refuted. 0 times theorem prover too weak. 19906 trivial. 0 not checked. [2021-11-19 05:20:43,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 05:20:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 36720 backedges. 176 proven. 94 refuted. 0 times theorem prover too weak. 36450 trivial. 0 not checked. [2021-11-19 05:20:45,021 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-19 05:20:45,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317455369] [2021-11-19 05:20:45,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [317455369] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-19 05:20:45,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-19 05:20:45,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2021-11-19 05:20:45,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191299627] [2021-11-19 05:20:45,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 05:20:45,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-19 05:20:45,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-19 05:20:45,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-19 05:20:45,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-19 05:20:45,090 INFO L87 Difference]: Start difference. First operand has 198 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 136 states have call successors, (136), 1 states have call predecessors, (136), 1 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (136), 2 states have call predecessors, (136), 2 states have return successors, (136), 2 states have call predecessors, (136), 2 states have call successors, (136) [2021-11-19 05:20:45,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 05:20:45,219 INFO L93 Difference]: Finished difference Result 390 states and 796 transitions. [2021-11-19 05:20:45,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-19 05:20:45,222 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (136), 2 states have call predecessors, (136), 2 states have return successors, (136), 2 states have call predecessors, (136), 2 states have call successors, (136) Word has length 734 [2021-11-19 05:20:45,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 05:20:45,242 INFO L225 Difference]: With dead ends: 390 [2021-11-19 05:20:45,242 INFO L226 Difference]: Without dead ends: 195 [2021-11-19 05:20:45,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1466 GetRequests, 1466 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-11-19 05:20:45,268 INFO L933 BasicCegarLoop]: 329 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, 329 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-11-19 05:20:45,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 05:20:45,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-11-19 05:20:45,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-11-19 05:20:45,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 57 states have (on average 1.0) internal successors, (57), 57 states have internal predecessors, (57), 136 states have call successors, (136), 1 states have call predecessors, (136), 1 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2021-11-19 05:20:45,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 329 transitions. [2021-11-19 05:20:45,428 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 329 transitions. Word has length 734 [2021-11-19 05:20:45,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 05:20:45,431 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 329 transitions. [2021-11-19 05:20:45,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (136), 2 states have call predecessors, (136), 2 states have return successors, (136), 2 states have call predecessors, (136), 2 states have call successors, (136) [2021-11-19 05:20:45,432 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 329 transitions. [2021-11-19 05:20:45,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2021-11-19 05:20:45,465 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 05:20:45,466 INFO L514 BasicCegarLoop]: trace histogram [136, 136, 136, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 05:20:45,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-19 05:20:45,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/mathsat -unsat_core_generation=3 [2021-11-19 05:20:45,686 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-19 05:20:45,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 05:20:45,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1555864369, now seen corresponding path program 1 times [2021-11-19 05:20:45,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-19 05:20:45,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802174075] [2021-11-19 05:20:45,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 05:20:45,691 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-19 05:20:45,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/mathsat [2021-11-19 05:20:45,693 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-19 05:20:45,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc1c764-c207-426b-82df-c93466d85557/bin/uautomizer-ZXIjhQolGL/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-19 05:21:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 05:21:04,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 252 conjunts are in the unsatisfiable core [2021-11-19 05:21:04,357 INFO L286 TraceCheckSpWp]: Computing forward predicates...