/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/xcsp/Dubois-016.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 01:05:36,222 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 01:05:36,224 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 01:05:36,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 01:05:36,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 01:05:36,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 01:05:36,252 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 01:05:36,253 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 01:05:36,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 01:05:36,255 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 01:05:36,256 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 01:05:36,266 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 01:05:36,266 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 01:05:36,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 01:05:36,268 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 01:05:36,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 01:05:36,269 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 01:05:36,270 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 01:05:36,271 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 01:05:36,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 01:05:36,273 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 01:05:36,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 01:05:36,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 01:05:36,275 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 01:05:36,277 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 01:05:36,278 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 01:05:36,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 01:05:36,278 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 01:05:36,279 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 01:05:36,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 01:05:36,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 01:05:36,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 01:05:36,280 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 01:05:36,281 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 01:05:36,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 01:05:36,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 01:05:36,282 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 01:05:36,282 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 01:05:36,282 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 01:05:36,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 01:05:36,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 01:05:36,284 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-11 01:05:36,299 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 01:05:36,299 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 01:05:36,299 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 01:05:36,299 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 01:05:36,300 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 01:05:36,300 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 01:05:36,301 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 01:05:36,301 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 01:05:36,301 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 01:05:36,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 01:05:36,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 01:05:36,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 01:05:36,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 01:05:36,302 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 01:05:36,302 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 01:05:36,302 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 01:05:36,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 01:05:36,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 01:05:36,302 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 01:05:36,302 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 01:05:36,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 01:05:36,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:05:36,303 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 01:05:36,303 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 01:05:36,303 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 01:05:36,303 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 01:05:36,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 01:05:36,304 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 01:05:36,304 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 01:05:36,304 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 01:05:36,304 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 01:05:36,304 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 01:05:36,305 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 01:05:36,305 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 01:05:36,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 01:05:36,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 01:05:36,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 01:05:36,587 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 01:05:36,587 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 01:05:36,588 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/xcsp/Dubois-016.c [2022-01-11 01:05:36,648 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4cd3eeab/99e53204237949d898d2ab5f15c8e519/FLAG4bdd65e21 [2022-01-11 01:05:37,049 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 01:05:37,049 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/xcsp/Dubois-016.c [2022-01-11 01:05:37,064 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4cd3eeab/99e53204237949d898d2ab5f15c8e519/FLAG4bdd65e21 [2022-01-11 01:05:37,446 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4cd3eeab/99e53204237949d898d2ab5f15c8e519 [2022-01-11 01:05:37,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 01:05:37,449 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 01:05:37,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 01:05:37,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 01:05:37,459 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 01:05:37,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:05:37" (1/1) ... [2022-01-11 01:05:37,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30eb9bf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:05:37, skipping insertion in model container [2022-01-11 01:05:37,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:05:37" (1/1) ... [2022-01-11 01:05:37,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 01:05:37,496 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 01:05:37,761 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/xcsp/Dubois-016.c[11664,11677] [2022-01-11 01:05:37,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:05:37,802 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 01:05:37,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/xcsp/Dubois-016.c[11664,11677] [2022-01-11 01:05:37,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:05:37,886 INFO L208 MainTranslator]: Completed translation [2022-01-11 01:05:37,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:05:37 WrapperNode [2022-01-11 01:05:37,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 01:05:37,887 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 01:05:37,888 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 01:05:37,888 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 01:05:37,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:05:37" (1/1) ... [2022-01-11 01:05:37,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:05:37" (1/1) ... [2022-01-11 01:05:37,974 INFO L137 Inliner]: procedures = 13, calls = 135, calls flagged for inlining = 130, calls inlined = 130, statements flattened = 673 [2022-01-11 01:05:37,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 01:05:37,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 01:05:37,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 01:05:37,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 01:05:37,982 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:05:37" (1/1) ... [2022-01-11 01:05:37,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:05:37" (1/1) ... [2022-01-11 01:05:37,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:05:37" (1/1) ... [2022-01-11 01:05:37,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:05:37" (1/1) ... [2022-01-11 01:05:38,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:05:37" (1/1) ... [2022-01-11 01:05:38,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:05:37" (1/1) ... [2022-01-11 01:05:38,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:05:37" (1/1) ... [2022-01-11 01:05:38,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 01:05:38,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 01:05:38,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 01:05:38,048 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 01:05:38,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:05:37" (1/1) ... [2022-01-11 01:05:38,074 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:05:38,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:05:38,109 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 01:05:38,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 01:05:38,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 01:05:38,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 01:05:38,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 01:05:38,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 01:05:38,271 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 01:05:38,272 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 01:05:38,836 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 01:05:38,843 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 01:05:38,844 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-11 01:05:38,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:05:38 BoogieIcfgContainer [2022-01-11 01:05:38,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 01:05:38,857 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 01:05:38,858 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 01:05:38,859 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 01:05:38,861 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:05:38" (1/1) ... [2022-01-11 01:05:39,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:05:39 BasicIcfg [2022-01-11 01:05:39,009 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 01:05:39,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 01:05:39,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 01:05:39,013 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 01:05:39,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 01:05:37" (1/4) ... [2022-01-11 01:05:39,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd4b159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:05:39, skipping insertion in model container [2022-01-11 01:05:39,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:05:37" (2/4) ... [2022-01-11 01:05:39,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd4b159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:05:39, skipping insertion in model container [2022-01-11 01:05:39,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:05:38" (3/4) ... [2022-01-11 01:05:39,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd4b159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 01:05:39, skipping insertion in model container [2022-01-11 01:05:39,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:05:39" (4/4) ... [2022-01-11 01:05:39,017 INFO L111 eAbstractionObserver]: Analyzing ICFG Dubois-016.cTransformedIcfg [2022-01-11 01:05:39,026 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 01:05:39,026 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 01:05:39,068 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 01:05:39,077 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 [2022-01-11 01:05:39,078 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 01:05:39,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 263 states, 261 states have (on average 1.4942528735632183) internal successors, (390), 262 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:05:39,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2022-01-11 01:05:39,137 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:05:39,141 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:05:39,142 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:05:39,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:05:39,151 INFO L85 PathProgramCache]: Analyzing trace with hash -936608368, now seen corresponding path program 1 times [2022-01-11 01:05:39,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:05:39,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904939307] [2022-01-11 01:05:39,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:05:39,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:05:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:05:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:05:39,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:05:39,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904939307] [2022-01-11 01:05:39,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904939307] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:05:39,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:05:39,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:05:39,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971842064] [2022-01-11 01:05:39,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:05:39,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-11 01:05:39,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:05:39,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-11 01:05:39,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 01:05:39,507 INFO L87 Difference]: Start difference. First operand has 263 states, 261 states have (on average 1.4942528735632183) internal successors, (390), 262 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:05:39,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:05:39,527 INFO L93 Difference]: Finished difference Result 520 states and 774 transitions. [2022-01-11 01:05:39,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-11 01:05:39,535 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 259 [2022-01-11 01:05:39,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:05:39,545 INFO L225 Difference]: With dead ends: 520 [2022-01-11 01:05:39,546 INFO L226 Difference]: Without dead ends: 260 [2022-01-11 01:05:39,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 01:05:39,553 INFO L933 BasicCegarLoop]: 259 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, 259 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 [2022-01-11 01:05:39,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:05:39,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-01-11 01:05:39,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2022-01-11 01:05:39,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 1.0) internal successors, (259), 259 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:05:39,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 259 transitions. [2022-01-11 01:05:39,586 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 259 transitions. Word has length 259 [2022-01-11 01:05:39,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:05:39,586 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 259 transitions. [2022-01-11 01:05:39,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:05:39,586 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 259 transitions. [2022-01-11 01:05:39,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2022-01-11 01:05:39,588 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:05:39,589 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:05:39,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 01:05:39,589 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:05:39,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:05:39,603 INFO L85 PathProgramCache]: Analyzing trace with hash -728641528, now seen corresponding path program 1 times [2022-01-11 01:05:39,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:05:39,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276486054] [2022-01-11 01:05:39,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:05:39,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:05:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 01:05:40,155 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-11 01:05:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 01:05:40,621 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-11 01:05:40,621 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-11 01:05:40,622 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-11 01:05:40,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 01:05:40,627 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-01-11 01:05:40,630 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 01:05:41,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 01:05:41 BasicIcfg [2022-01-11 01:05:41,033 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 01:05:41,033 INFO L158 Benchmark]: Toolchain (without parser) took 3583.97ms. Allocated memory was 184.5MB in the beginning and 237.0MB in the end (delta: 52.4MB). Free memory was 126.1MB in the beginning and 128.8MB in the end (delta: -2.7MB). Peak memory consumption was 126.3MB. Max. memory is 8.0GB. [2022-01-11 01:05:41,033 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 184.5MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 01:05:41,034 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.03ms. Allocated memory was 184.5MB in the beginning and 237.0MB in the end (delta: 52.4MB). Free memory was 126.0MB in the beginning and 200.7MB in the end (delta: -74.8MB). Peak memory consumption was 16.5MB. Max. memory is 8.0GB. [2022-01-11 01:05:41,034 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.21ms. Allocated memory is still 237.0MB. Free memory was 200.7MB in the beginning and 194.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-01-11 01:05:41,035 INFO L158 Benchmark]: Boogie Preprocessor took 72.11ms. Allocated memory is still 237.0MB. Free memory was 194.5MB in the beginning and 190.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-11 01:05:41,035 INFO L158 Benchmark]: RCFGBuilder took 809.01ms. Allocated memory is still 237.0MB. Free memory was 190.3MB in the beginning and 154.6MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-01-11 01:05:41,035 INFO L158 Benchmark]: IcfgTransformer took 151.28ms. Allocated memory is still 237.0MB. Free memory was 154.6MB in the beginning and 138.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-01-11 01:05:41,036 INFO L158 Benchmark]: TraceAbstraction took 2022.52ms. Allocated memory is still 237.0MB. Free memory was 137.8MB in the beginning and 128.8MB in the end (delta: 9.0MB). Peak memory consumption was 86.5MB. Max. memory is 8.0GB. [2022-01-11 01:05:41,038 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.10ms. Allocated memory is still 184.5MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 431.03ms. Allocated memory was 184.5MB in the beginning and 237.0MB in the end (delta: 52.4MB). Free memory was 126.0MB in the beginning and 200.7MB in the end (delta: -74.8MB). Peak memory consumption was 16.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 87.21ms. Allocated memory is still 237.0MB. Free memory was 200.7MB in the beginning and 194.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 72.11ms. Allocated memory is still 237.0MB. Free memory was 194.5MB in the beginning and 190.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 809.01ms. Allocated memory is still 237.0MB. Free memory was 190.3MB in the beginning and 154.6MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * IcfgTransformer took 151.28ms. Allocated memory is still 237.0MB. Free memory was 154.6MB in the beginning and 138.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 2022.52ms. Allocated memory is still 237.0MB. Free memory was 137.8MB in the beginning and 128.8MB in the end (delta: 9.0MB). Peak memory consumption was 86.5MB. Max. memory is 8.0GB. * 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: 346]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of BvToInt. 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) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L27] RET assume(var0 >= 0) [L28] CALL assume(var0 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L28] RET assume(var0 <= 1) [L29] int var1; [L30] var1 = __VERIFIER_nondet_int() [L31] CALL assume(var1 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L31] RET assume(var1 >= 0) [L32] CALL assume(var1 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L32] RET assume(var1 <= 1) [L33] int var2; [L34] var2 = __VERIFIER_nondet_int() [L35] CALL assume(var2 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L35] RET assume(var2 >= 0) [L36] CALL assume(var2 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L36] RET assume(var2 <= 1) [L37] int var3; [L38] var3 = __VERIFIER_nondet_int() [L39] CALL assume(var3 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L39] RET assume(var3 >= 0) [L40] CALL assume(var3 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L40] RET assume(var3 <= 1) [L41] int var4; [L42] var4 = __VERIFIER_nondet_int() [L43] CALL assume(var4 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L43] RET assume(var4 >= 0) [L44] CALL assume(var4 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L44] RET assume(var4 <= 1) [L45] int var5; [L46] var5 = __VERIFIER_nondet_int() [L47] CALL assume(var5 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L47] RET assume(var5 >= 0) [L48] CALL assume(var5 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L48] RET assume(var5 <= 1) [L49] int var6; [L50] var6 = __VERIFIER_nondet_int() [L51] CALL assume(var6 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L51] RET assume(var6 >= 0) [L52] CALL assume(var6 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L52] RET assume(var6 <= 1) [L53] int var7; [L54] var7 = __VERIFIER_nondet_int() [L55] CALL assume(var7 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L55] RET assume(var7 >= 0) [L56] CALL assume(var7 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L56] RET assume(var7 <= 1) [L57] int var8; [L58] var8 = __VERIFIER_nondet_int() [L59] CALL assume(var8 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L59] RET assume(var8 >= 0) [L60] CALL assume(var8 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L60] RET assume(var8 <= 1) [L61] int var9; [L62] var9 = __VERIFIER_nondet_int() [L63] CALL assume(var9 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L63] RET assume(var9 >= 0) [L64] CALL assume(var9 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L64] RET assume(var9 <= 1) [L65] int var10; [L66] var10 = __VERIFIER_nondet_int() [L67] CALL assume(var10 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L67] RET assume(var10 >= 0) [L68] CALL assume(var10 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L68] RET assume(var10 <= 1) [L69] int var11; [L70] var11 = __VERIFIER_nondet_int() [L71] CALL assume(var11 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L71] RET assume(var11 >= 0) [L72] CALL assume(var11 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L72] RET assume(var11 <= 1) [L73] int var12; [L74] var12 = __VERIFIER_nondet_int() [L75] CALL assume(var12 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L75] RET assume(var12 >= 0) [L76] CALL assume(var12 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L76] RET assume(var12 <= 1) [L77] int var13; [L78] var13 = __VERIFIER_nondet_int() [L79] CALL assume(var13 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L79] RET assume(var13 >= 0) [L80] CALL assume(var13 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L80] RET assume(var13 <= 1) [L81] int var14; [L82] var14 = __VERIFIER_nondet_int() [L83] CALL assume(var14 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L83] RET assume(var14 >= 0) [L84] CALL assume(var14 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L84] RET assume(var14 <= 1) [L85] int var15; [L86] var15 = __VERIFIER_nondet_int() [L87] CALL assume(var15 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L87] RET assume(var15 >= 0) [L88] CALL assume(var15 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L88] RET assume(var15 <= 1) [L89] int var16; [L90] var16 = __VERIFIER_nondet_int() [L91] CALL assume(var16 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L91] RET assume(var16 >= 0) [L92] CALL assume(var16 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L92] RET assume(var16 <= 1) [L93] int var17; [L94] var17 = __VERIFIER_nondet_int() [L95] CALL assume(var17 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L95] RET assume(var17 >= 0) [L96] CALL assume(var17 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L96] RET assume(var17 <= 1) [L97] int var18; [L98] var18 = __VERIFIER_nondet_int() [L99] CALL assume(var18 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L99] RET assume(var18 >= 0) [L100] CALL assume(var18 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L100] RET assume(var18 <= 1) [L101] int var19; [L102] var19 = __VERIFIER_nondet_int() [L103] CALL assume(var19 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L103] RET assume(var19 >= 0) [L104] CALL assume(var19 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L104] RET assume(var19 <= 1) [L105] int var20; [L106] var20 = __VERIFIER_nondet_int() [L107] CALL assume(var20 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L107] RET assume(var20 >= 0) [L108] CALL assume(var20 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L108] RET assume(var20 <= 1) [L109] int var21; [L110] var21 = __VERIFIER_nondet_int() [L111] CALL assume(var21 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L111] RET assume(var21 >= 0) [L112] CALL assume(var21 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L112] RET assume(var21 <= 1) [L113] int var22; [L114] var22 = __VERIFIER_nondet_int() [L115] CALL assume(var22 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L115] RET assume(var22 >= 0) [L116] CALL assume(var22 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L116] RET assume(var22 <= 1) [L117] int var23; [L118] var23 = __VERIFIER_nondet_int() [L119] CALL assume(var23 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L119] RET assume(var23 >= 0) [L120] CALL assume(var23 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L120] RET assume(var23 <= 1) [L121] int var24; [L122] var24 = __VERIFIER_nondet_int() [L123] CALL assume(var24 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L123] RET assume(var24 >= 0) [L124] CALL assume(var24 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L124] RET assume(var24 <= 1) [L125] int var25; [L126] var25 = __VERIFIER_nondet_int() [L127] CALL assume(var25 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L127] RET assume(var25 >= 0) [L128] CALL assume(var25 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L128] RET assume(var25 <= 1) [L129] int var26; [L130] var26 = __VERIFIER_nondet_int() [L131] CALL assume(var26 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L131] RET assume(var26 >= 0) [L132] CALL assume(var26 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L132] RET assume(var26 <= 1) [L133] int var27; [L134] var27 = __VERIFIER_nondet_int() [L135] CALL assume(var27 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L135] RET assume(var27 >= 0) [L136] CALL assume(var27 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L136] RET assume(var27 <= 1) [L137] int var28; [L138] var28 = __VERIFIER_nondet_int() [L139] CALL assume(var28 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L139] RET assume(var28 >= 0) [L140] CALL assume(var28 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L140] RET assume(var28 <= 1) [L141] int var29; [L142] var29 = __VERIFIER_nondet_int() [L143] CALL assume(var29 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L143] RET assume(var29 >= 0) [L144] CALL assume(var29 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L144] RET assume(var29 <= 1) [L145] int var30; [L146] var30 = __VERIFIER_nondet_int() [L147] CALL assume(var30 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L147] RET assume(var30 >= 0) [L148] CALL assume(var30 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L148] RET assume(var30 <= 1) [L149] int var31; [L150] var31 = __VERIFIER_nondet_int() [L151] CALL assume(var31 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L151] RET assume(var31 >= 0) [L152] CALL assume(var31 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L152] RET assume(var31 <= 1) [L153] int var32; [L154] var32 = __VERIFIER_nondet_int() [L155] CALL assume(var32 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L155] RET assume(var32 >= 0) [L156] CALL assume(var32 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L156] RET assume(var32 <= 1) [L157] int var33; [L158] var33 = __VERIFIER_nondet_int() [L159] CALL assume(var33 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L159] RET assume(var33 >= 0) [L160] CALL assume(var33 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L160] RET assume(var33 <= 1) [L161] int var34; [L162] var34 = __VERIFIER_nondet_int() [L163] CALL assume(var34 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L163] RET assume(var34 >= 0) [L164] CALL assume(var34 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L164] RET assume(var34 <= 1) [L165] int var35; [L166] var35 = __VERIFIER_nondet_int() [L167] CALL assume(var35 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L167] RET assume(var35 >= 0) [L168] CALL assume(var35 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L168] RET assume(var35 <= 1) [L169] int var36; [L170] var36 = __VERIFIER_nondet_int() [L171] CALL assume(var36 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L171] RET assume(var36 >= 0) [L172] CALL assume(var36 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L172] RET assume(var36 <= 1) [L173] int var37; [L174] var37 = __VERIFIER_nondet_int() [L175] CALL assume(var37 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L175] RET assume(var37 >= 0) [L176] CALL assume(var37 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L176] RET assume(var37 <= 1) [L177] int var38; [L178] var38 = __VERIFIER_nondet_int() [L179] CALL assume(var38 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L179] RET assume(var38 >= 0) [L180] CALL assume(var38 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L180] RET assume(var38 <= 1) [L181] int var39; [L182] var39 = __VERIFIER_nondet_int() [L183] CALL assume(var39 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L183] RET assume(var39 >= 0) [L184] CALL assume(var39 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L184] RET assume(var39 <= 1) [L185] int var40; [L186] var40 = __VERIFIER_nondet_int() [L187] CALL assume(var40 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L187] RET assume(var40 >= 0) [L188] CALL assume(var40 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L188] RET assume(var40 <= 1) [L189] int var41; [L190] var41 = __VERIFIER_nondet_int() [L191] CALL assume(var41 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L191] RET assume(var41 >= 0) [L192] CALL assume(var41 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L192] RET assume(var41 <= 1) [L193] int var42; [L194] var42 = __VERIFIER_nondet_int() [L195] CALL assume(var42 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L195] RET assume(var42 >= 0) [L196] CALL assume(var42 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L196] RET assume(var42 <= 1) [L197] int var43; [L198] var43 = __VERIFIER_nondet_int() [L199] CALL assume(var43 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L199] RET assume(var43 >= 0) [L200] CALL assume(var43 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L200] RET assume(var43 <= 1) [L201] int var44; [L202] var44 = __VERIFIER_nondet_int() [L203] CALL assume(var44 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L203] RET assume(var44 >= 0) [L204] CALL assume(var44 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L204] RET assume(var44 <= 1) [L205] int var45; [L206] var45 = __VERIFIER_nondet_int() [L207] CALL assume(var45 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L207] RET assume(var45 >= 0) [L208] CALL assume(var45 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L208] RET assume(var45 <= 1) [L209] int var46; [L210] var46 = __VERIFIER_nondet_int() [L211] CALL assume(var46 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L211] RET assume(var46 >= 0) [L212] CALL assume(var46 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L212] RET assume(var46 <= 1) [L213] int var47; [L214] var47 = __VERIFIER_nondet_int() [L215] CALL assume(var47 >= 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L215] RET assume(var47 >= 0) [L216] CALL assume(var47 <= 1) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L216] RET assume(var47 <= 1) [L217] int myvar0 = 1; [L218-L221] CALL assume((var30 == 0 & var31 == 0 & var0 == 1) | (var30 == 0 & var31 == 1 & var0 == 0) | (var30 == 1 & var31 == 0 & var0 == 0) | (var30 == 1 & var31 == 1 & var0 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L218-L221] RET assume((var30 == 0 & var31 == 0 & var0 == 1) | (var30 == 0 & var31 == 1 & var0 == 0) | (var30 == 1 & var31 == 0 & var0 == 0) | (var30 == 1 & var31 == 1 & var0 == 1) | 0) [L222-L225] CALL assume((var1 == 0 & var33 == 0 & var2 == 1) | (var1 == 0 & var33 == 1 & var2 == 0) | (var1 == 1 & var33 == 0 & var2 == 0) | (var1 == 1 & var33 == 1 & var2 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L222-L225] RET assume((var1 == 0 & var33 == 0 & var2 == 1) | (var1 == 0 & var33 == 1 & var2 == 0) | (var1 == 1 & var33 == 0 & var2 == 0) | (var1 == 1 & var33 == 1 & var2 == 1) | 0) [L226-L229] CALL assume((var2 == 0 & var34 == 0 & var3 == 1) | (var2 == 0 & var34 == 1 & var3 == 0) | (var2 == 1 & var34 == 0 & var3 == 0) | (var2 == 1 & var34 == 1 & var3 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=4, cond=4] [L226-L229] RET assume((var2 == 0 & var34 == 0 & var3 == 1) | (var2 == 0 & var34 == 1 & var3 == 0) | (var2 == 1 & var34 == 0 & var3 == 0) | (var2 == 1 & var34 == 1 & var3 == 1) | 0) [L230-L233] CALL assume((var3 == 0 & var35 == 0 & var4 == 1) | (var3 == 0 & var35 == 1 & var4 == 0) | (var3 == 1 & var35 == 0 & var4 == 0) | (var3 == 1 & var35 == 1 & var4 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=5, cond=5] [L230-L233] RET assume((var3 == 0 & var35 == 0 & var4 == 1) | (var3 == 0 & var35 == 1 & var4 == 0) | (var3 == 1 & var35 == 0 & var4 == 0) | (var3 == 1 & var35 == 1 & var4 == 1) | 0) [L234-L237] CALL assume((var4 == 0 & var36 == 0 & var5 == 1) | (var4 == 0 & var36 == 1 & var5 == 0) | (var4 == 1 & var36 == 0 & var5 == 0) | (var4 == 1 & var36 == 1 & var5 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=6, cond=6] [L234-L237] RET assume((var4 == 0 & var36 == 0 & var5 == 1) | (var4 == 0 & var36 == 1 & var5 == 0) | (var4 == 1 & var36 == 0 & var5 == 0) | (var4 == 1 & var36 == 1 & var5 == 1) | 0) [L238-L241] CALL assume((var5 == 0 & var37 == 0 & var6 == 1) | (var5 == 0 & var37 == 1 & var6 == 0) | (var5 == 1 & var37 == 0 & var6 == 0) | (var5 == 1 & var37 == 1 & var6 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=7, cond=7] [L238-L241] RET assume((var5 == 0 & var37 == 0 & var6 == 1) | (var5 == 0 & var37 == 1 & var6 == 0) | (var5 == 1 & var37 == 0 & var6 == 0) | (var5 == 1 & var37 == 1 & var6 == 1) | 0) [L242-L245] CALL assume((var6 == 0 & var38 == 0 & var7 == 1) | (var6 == 0 & var38 == 1 & var7 == 0) | (var6 == 1 & var38 == 0 & var7 == 0) | (var6 == 1 & var38 == 1 & var7 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=8, cond=8] [L242-L245] RET assume((var6 == 0 & var38 == 0 & var7 == 1) | (var6 == 0 & var38 == 1 & var7 == 0) | (var6 == 1 & var38 == 0 & var7 == 0) | (var6 == 1 & var38 == 1 & var7 == 1) | 0) [L246-L249] CALL assume((var7 == 0 & var39 == 0 & var8 == 1) | (var7 == 0 & var39 == 1 & var8 == 0) | (var7 == 1 & var39 == 0 & var8 == 0) | (var7 == 1 & var39 == 1 & var8 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=9, cond=9] [L246-L249] RET assume((var7 == 0 & var39 == 0 & var8 == 1) | (var7 == 0 & var39 == 1 & var8 == 0) | (var7 == 1 & var39 == 0 & var8 == 0) | (var7 == 1 & var39 == 1 & var8 == 1) | 0) [L250-L253] CALL assume((var8 == 0 & var40 == 0 & var9 == 1) | (var8 == 0 & var40 == 1 & var9 == 0) | (var8 == 1 & var40 == 0 & var9 == 0) | (var8 == 1 & var40 == 1 & var9 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=10, cond=10] [L250-L253] RET assume((var8 == 0 & var40 == 0 & var9 == 1) | (var8 == 0 & var40 == 1 & var9 == 0) | (var8 == 1 & var40 == 0 & var9 == 0) | (var8 == 1 & var40 == 1 & var9 == 1) | 0) [L254-L257] CALL assume((var9 == 0 & var41 == 0 & var10 == 1) | (var9 == 0 & var41 == 1 & var10 == 0) | (var9 == 1 & var41 == 0 & var10 == 0) | (var9 == 1 & var41 == 1 & var10 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=11, cond=11] [L254-L257] RET assume((var9 == 0 & var41 == 0 & var10 == 1) | (var9 == 0 & var41 == 1 & var10 == 0) | (var9 == 1 & var41 == 0 & var10 == 0) | (var9 == 1 & var41 == 1 & var10 == 1) | 0) [L258-L261] CALL assume((var10 == 0 & var42 == 0 & var11 == 1) | (var10 == 0 & var42 == 1 & var11 == 0) | (var10 == 1 & var42 == 0 & var11 == 0) | (var10 == 1 & var42 == 1 & var11 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=14, cond=14] [L258-L261] RET assume((var10 == 0 & var42 == 0 & var11 == 1) | (var10 == 0 & var42 == 1 & var11 == 0) | (var10 == 1 & var42 == 0 & var11 == 0) | (var10 == 1 & var42 == 1 & var11 == 1) | 0) [L262-L265] CALL assume((var11 == 0 & var43 == 0 & var12 == 1) | (var11 == 0 & var43 == 1 & var12 == 0) | (var11 == 1 & var43 == 0 & var12 == 0) | (var11 == 1 & var43 == 1 & var12 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=15, cond=15] [L262-L265] RET assume((var11 == 0 & var43 == 0 & var12 == 1) | (var11 == 0 & var43 == 1 & var12 == 0) | (var11 == 1 & var43 == 0 & var12 == 0) | (var11 == 1 & var43 == 1 & var12 == 1) | 0) [L266-L269] CALL assume((var12 == 0 & var44 == 0 & var13 == 1) | (var12 == 0 & var44 == 1 & var13 == 0) | (var12 == 1 & var44 == 0 & var13 == 0) | (var12 == 1 & var44 == 1 & var13 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=16, cond=16] [L266-L269] RET assume((var12 == 0 & var44 == 0 & var13 == 1) | (var12 == 0 & var44 == 1 & var13 == 0) | (var12 == 1 & var44 == 0 & var13 == 0) | (var12 == 1 & var44 == 1 & var13 == 1) | 0) [L270-L273] CALL assume((var13 == 0 & var45 == 0 & var14 == 1) | (var13 == 0 & var45 == 1 & var14 == 0) | (var13 == 1 & var45 == 0 & var14 == 0) | (var13 == 1 & var45 == 1 & var14 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L270-L273] RET assume((var13 == 0 & var45 == 0 & var14 == 1) | (var13 == 0 & var45 == 1 & var14 == 0) | (var13 == 1 & var45 == 0 & var14 == 0) | (var13 == 1 & var45 == 1 & var14 == 1) | 0) [L274-L277] CALL assume((var0 == 0 & var32 == 0 & var1 == 1) | (var0 == 0 & var32 == 1 & var1 == 0) | (var0 == 1 & var32 == 0 & var1 == 0) | (var0 == 1 & var32 == 1 & var1 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L274-L277] RET assume((var0 == 0 & var32 == 0 & var1 == 1) | (var0 == 0 & var32 == 1 & var1 == 0) | (var0 == 1 & var32 == 0 & var1 == 0) | (var0 == 1 & var32 == 1 & var1 == 1) | 0) [L278-L281] CALL assume((var15 == 0 & var46 == 0 & var47 == 1) | (var15 == 0 & var46 == 1 & var47 == 0) | (var15 == 1 & var46 == 0 & var47 == 0) | (var15 == 1 & var46 == 1 & var47 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L278-L281] RET assume((var15 == 0 & var46 == 0 & var47 == 1) | (var15 == 0 & var46 == 1 & var47 == 0) | (var15 == 1 & var46 == 0 & var47 == 0) | (var15 == 1 & var46 == 1 & var47 == 1) | 0) [L282-L285] CALL assume((var14 == 0 & var46 == 0 & var47 == 1) | (var14 == 0 & var46 == 1 & var47 == 0) | (var14 == 1 & var46 == 0 & var47 == 0) | (var14 == 1 & var46 == 1 & var47 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=17, cond=17] [L282-L285] RET assume((var14 == 0 & var46 == 0 & var47 == 1) | (var14 == 0 & var46 == 1 & var47 == 0) | (var14 == 1 & var46 == 0 & var47 == 0) | (var14 == 1 & var46 == 1 & var47 == 1) | 0) [L286-L289] CALL assume((var17 == 0 & var44 == 0 & var16 == 1) | (var17 == 0 & var44 == 1 & var16 == 0) | (var17 == 1 & var44 == 0 & var16 == 0) | (var17 == 1 & var44 == 1 & var16 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L286-L289] RET assume((var17 == 0 & var44 == 0 & var16 == 1) | (var17 == 0 & var44 == 1 & var16 == 0) | (var17 == 1 & var44 == 0 & var16 == 0) | (var17 == 1 & var44 == 1 & var16 == 1) | 0) [L290-L293] CALL assume((var18 == 0 & var43 == 0 & var17 == 1) | (var18 == 0 & var43 == 1 & var17 == 0) | (var18 == 1 & var43 == 0 & var17 == 0) | (var18 == 1 & var43 == 1 & var17 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=18, cond=18] [L290-L293] RET assume((var18 == 0 & var43 == 0 & var17 == 1) | (var18 == 0 & var43 == 1 & var17 == 0) | (var18 == 1 & var43 == 0 & var17 == 0) | (var18 == 1 & var43 == 1 & var17 == 1) | 0) [L294-L297] CALL assume((var19 == 0 & var42 == 0 & var18 == 1) | (var19 == 0 & var42 == 1 & var18 == 0) | (var19 == 1 & var42 == 0 & var18 == 0) | (var19 == 1 & var42 == 1 & var18 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L294-L297] RET assume((var19 == 0 & var42 == 0 & var18 == 1) | (var19 == 0 & var42 == 1 & var18 == 0) | (var19 == 1 & var42 == 0 & var18 == 0) | (var19 == 1 & var42 == 1 & var18 == 1) | 0) [L298-L301] CALL assume((var20 == 0 & var41 == 0 & var19 == 1) | (var20 == 0 & var41 == 1 & var19 == 0) | (var20 == 1 & var41 == 0 & var19 == 0) | (var20 == 1 & var41 == 1 & var19 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=19, cond=19] [L298-L301] RET assume((var20 == 0 & var41 == 0 & var19 == 1) | (var20 == 0 & var41 == 1 & var19 == 0) | (var20 == 1 & var41 == 0 & var19 == 0) | (var20 == 1 & var41 == 1 & var19 == 1) | 0) [L302-L305] CALL assume((var21 == 0 & var40 == 0 & var20 == 1) | (var21 == 0 & var40 == 1 & var20 == 0) | (var21 == 1 & var40 == 0 & var20 == 0) | (var21 == 1 & var40 == 1 & var20 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=20, cond=20] [L302-L305] RET assume((var21 == 0 & var40 == 0 & var20 == 1) | (var21 == 0 & var40 == 1 & var20 == 0) | (var21 == 1 & var40 == 0 & var20 == 0) | (var21 == 1 & var40 == 1 & var20 == 1) | 0) [L306-L309] CALL assume((var22 == 0 & var39 == 0 & var21 == 1) | (var22 == 0 & var39 == 1 & var21 == 0) | (var22 == 1 & var39 == 0 & var21 == 0) | (var22 == 1 & var39 == 1 & var21 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L306-L309] RET assume((var22 == 0 & var39 == 0 & var21 == 1) | (var22 == 0 & var39 == 1 & var21 == 0) | (var22 == 1 & var39 == 0 & var21 == 0) | (var22 == 1 & var39 == 1 & var21 == 1) | 0) [L310-L313] CALL assume((var23 == 0 & var38 == 0 & var22 == 1) | (var23 == 0 & var38 == 1 & var22 == 0) | (var23 == 1 & var38 == 0 & var22 == 0) | (var23 == 1 & var38 == 1 & var22 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L310-L313] RET assume((var23 == 0 & var38 == 0 & var22 == 1) | (var23 == 0 & var38 == 1 & var22 == 0) | (var23 == 1 & var38 == 0 & var22 == 0) | (var23 == 1 & var38 == 1 & var22 == 1) | 0) [L314-L317] CALL assume((var24 == 0 & var37 == 0 & var23 == 1) | (var24 == 0 & var37 == 1 & var23 == 0) | (var24 == 1 & var37 == 0 & var23 == 0) | (var24 == 1 & var37 == 1 & var23 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=21, cond=21] [L314-L317] RET assume((var24 == 0 & var37 == 0 & var23 == 1) | (var24 == 0 & var37 == 1 & var23 == 0) | (var24 == 1 & var37 == 0 & var23 == 0) | (var24 == 1 & var37 == 1 & var23 == 1) | 0) [L318-L321] CALL assume((var25 == 0 & var36 == 0 & var24 == 1) | (var25 == 0 & var36 == 1 & var24 == 0) | (var25 == 1 & var36 == 0 & var24 == 0) | (var25 == 1 & var36 == 1 & var24 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=22, cond=22] [L318-L321] RET assume((var25 == 0 & var36 == 0 & var24 == 1) | (var25 == 0 & var36 == 1 & var24 == 0) | (var25 == 1 & var36 == 0 & var24 == 0) | (var25 == 1 & var36 == 1 & var24 == 1) | 0) [L322-L325] CALL assume((var26 == 0 & var35 == 0 & var25 == 1) | (var26 == 0 & var35 == 1 & var25 == 0) | (var26 == 1 & var35 == 0 & var25 == 0) | (var26 == 1 & var35 == 1 & var25 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=23, cond=23] [L322-L325] RET assume((var26 == 0 & var35 == 0 & var25 == 1) | (var26 == 0 & var35 == 1 & var25 == 0) | (var26 == 1 & var35 == 0 & var25 == 0) | (var26 == 1 & var35 == 1 & var25 == 1) | 0) [L326-L329] CALL assume((var27 == 0 & var34 == 0 & var26 == 1) | (var27 == 0 & var34 == 1 & var26 == 0) | (var27 == 1 & var34 == 0 & var26 == 0) | (var27 == 1 & var34 == 1 & var26 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L326-L329] RET assume((var27 == 0 & var34 == 0 & var26 == 1) | (var27 == 0 & var34 == 1 & var26 == 0) | (var27 == 1 & var34 == 0 & var26 == 0) | (var27 == 1 & var34 == 1 & var26 == 1) | 0) [L330-L333] CALL assume((var28 == 0 & var33 == 0 & var27 == 1) | (var28 == 0 & var33 == 1 & var27 == 0) | (var28 == 1 & var33 == 0 & var27 == 0) | (var28 == 1 & var33 == 1 & var27 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L330-L333] RET assume((var28 == 0 & var33 == 0 & var27 == 1) | (var28 == 0 & var33 == 1 & var27 == 0) | (var28 == 1 & var33 == 0 & var27 == 0) | (var28 == 1 & var33 == 1 & var27 == 1) | 0) [L334-L337] CALL assume((var29 == 0 & var32 == 0 & var28 == 1) | (var29 == 0 & var32 == 1 & var28 == 0) | (var29 == 1 & var32 == 0 & var28 == 0) | (var29 == 1 & var32 == 1 & var28 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L334-L337] RET assume((var29 == 0 & var32 == 0 & var28 == 1) | (var29 == 0 & var32 == 1 & var28 == 0) | (var29 == 1 & var32 == 0 & var28 == 0) | (var29 == 1 & var32 == 1 & var28 == 1) | 0) [L338-L341] CALL assume((var16 == 0 & var45 == 0 & var15 == 1) | (var16 == 0 & var45 == 1 & var15 == 0) | (var16 == 1 & var45 == 0 & var15 == 0) | (var16 == 1 & var45 == 1 & var15 == 1) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=24, cond=24] [L338-L341] RET assume((var16 == 0 & var45 == 0 & var15 == 1) | (var16 == 0 & var45 == 1 & var15 == 0) | (var16 == 1 & var45 == 0 & var15 == 0) | (var16 == 1 & var45 == 1 & var15 == 1) | 0) [L342-L345] CALL assume((var30 == 0 & var31 == 0 & var29 == 0) | (var30 == 0 & var31 == 1 & var29 == 1) | (var30 == 1 & var31 == 0 & var29 == 1) | (var30 == 1 & var31 == 1 & var29 == 0) | 0) [L18] COND FALSE !(!cond) VAL [\old(cond)=25, cond=25] [L342-L345] RET assume((var30 == 0 & var31 == 0 & var29 == 0) | (var30 == 0 & var31 == 1 & var29 == 1) | (var30 == 1 & var31 == 0 & var29 == 1) | (var30 == 1 & var31 == 1 & var29 == 0) | 0) [L346] reach_error() VAL [dummy=0, myvar0=1, var0=0, var1=0, var10=0, var11=0, var12=0, var13=0, var14=0, var15=0, var16=0, var17=0, var18=0, var19=0, var2=0, var20=0, var21=0, var22=0, var23=0, var24=0, var25=0, var26=0, var27=0, var28=0, var29=0, var3=0, var30=0, var31=0, var32=0, var33=0, var34=0, var35=0, var36=0, var37=0, var38=0, var39=0, var4=0, var40=0, var41=0, var42=0, var43=0, var44=0, var45=0, var46=0, var47=0, var5=0, var6=0, var7=0, var8=0, var9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 263 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 259 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, 259 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=263occurred 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.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 518 NumberOfCodeBlocks, 518 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 258 ConstructedInterpolants, 0 QuantifiedInterpolants, 258 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 [2022-01-11 01:05:41,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...