./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label12.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 4f9af400
extending candidate: java
['java']
extending candidate: /usr/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/oracle-jdk-bin-*/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/openjdk-*/bin/java
['java', '/usr/bin/java']
extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java
['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java']
['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/eca-rers2012/Problem10_label12.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '39f3cc064c71123bb9e4b803da9068c3bd3922de54535c60f5073de19f640e81']
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label12.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 39f3cc064c71123bb9e4b803da9068c3bd3922de54535c60f5073de19f640e81
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-06 19:36:06,103 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-06 19:36:06,198 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-06 19:36:06,203 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-06 19:36:06,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-06 19:36:06,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-06 19:36:06,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-06 19:36:06,234 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-06 19:36:06,234 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-06 19:36:06,235 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-06 19:36:06,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-06 19:36:06,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-06 19:36:06,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-06 19:36:06,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-06 19:36:06,236 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-06 19:36:06,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-06 19:36:06,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-06 19:36:06,236 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-06 19:36:06,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-06 19:36:06,237 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-06 19:36:06,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-06 19:36:06,237 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-06 19:36:06,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-06 19:36:06,237 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-06 19:36:06,238 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-06 19:36:06,238 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-06 19:36:06,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-06 19:36:06,238 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-06 19:36:06,238 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-06 19:36:06,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-06 19:36:06,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-06 19:36:06,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-06 19:36:06,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-06 19:36:06,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-06 19:36:06,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-06 19:36:06,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-06 19:36:06,239 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-06 19:36:06,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-06 19:36:06,240 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-06 19:36:06,240 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-06 19:36:06,240 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-06 19:36:06,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-06 19:36:06,240 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
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 -> 39f3cc064c71123bb9e4b803da9068c3bd3922de54535c60f5073de19f640e81
[2024-11-06 19:36:06,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-06 19:36:06,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-06 19:36:06,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-06 19:36:06,503 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-06 19:36:06,504 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-06 19:36:06,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label12.c
[2024-11-06 19:36:07,815 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-06 19:36:08,081 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-06 19:36:08,081 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label12.c
[2024-11-06 19:36:08,103 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/958aa741b/da9958de79ab430ead1daf097c6af47f/FLAG43b839137
[2024-11-06 19:36:08,379 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/958aa741b/da9958de79ab430ead1daf097c6af47f
[2024-11-06 19:36:08,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-06 19:36:08,384 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-06 19:36:08,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-06 19:36:08,385 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-06 19:36:08,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-06 19:36:08,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:36:08" (1/1) ...
[2024-11-06 19:36:08,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70459a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:36:08, skipping insertion in model container
[2024-11-06 19:36:08,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:36:08" (1/1) ...
[2024-11-06 19:36:08,415 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-06 19:36:08,545 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label12.c[1644,1657]
[2024-11-06 19:36:08,663 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-06 19:36:08,677 INFO L200 MainTranslator]: Completed pre-run
[2024-11-06 19:36:08,687 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label12.c[1644,1657]
[2024-11-06 19:36:08,745 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-06 19:36:08,758 INFO L204 MainTranslator]: Completed translation
[2024-11-06 19:36:08,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:36:08 WrapperNode
[2024-11-06 19:36:08,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-06 19:36:08,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-06 19:36:08,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-06 19:36:08,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-06 19:36:08,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:36:08" (1/1) ...
[2024-11-06 19:36:08,781 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:36:08" (1/1) ...
[2024-11-06 19:36:08,830 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598
[2024-11-06 19:36:08,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-06 19:36:08,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-06 19:36:08,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-06 19:36:08,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-06 19:36:08,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:36:08" (1/1) ...
[2024-11-06 19:36:08,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:36:08" (1/1) ...
[2024-11-06 19:36:08,845 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:36:08" (1/1) ...
[2024-11-06 19:36:08,896 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-06 19:36:08,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:36:08" (1/1) ...
[2024-11-06 19:36:08,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:36:08" (1/1) ...
[2024-11-06 19:36:08,918 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:36:08" (1/1) ...
[2024-11-06 19:36:08,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:36:08" (1/1) ...
[2024-11-06 19:36:08,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:36:08" (1/1) ...
[2024-11-06 19:36:08,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:36:08" (1/1) ...
[2024-11-06 19:36:08,955 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-06 19:36:08,957 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-06 19:36:08,958 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-06 19:36:08,958 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-06 19:36:08,959 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:36:08" (1/1) ...
[2024-11-06 19:36:08,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-06 19:36:08,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-06 19:36:08,986 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-06 19:36:08,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-06 19:36:09,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-06 19:36:09,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-06 19:36:09,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-06 19:36:09,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-06 19:36:09,065 INFO L238 CfgBuilder]: Building ICFG
[2024-11-06 19:36:09,066 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-06 19:36:09,982 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live.
[2024-11-06 19:36:09,982 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-06 19:36:09,995 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-06 19:36:09,995 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-06 19:36:09,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:36:09 BoogieIcfgContainer
[2024-11-06 19:36:09,996 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-06 19:36:09,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-06 19:36:09,997 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-06 19:36:10,000 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-06 19:36:10,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:36:08" (1/3) ...
[2024-11-06 19:36:10,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e42cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:36:10, skipping insertion in model container
[2024-11-06 19:36:10,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:36:08" (2/3) ...
[2024-11-06 19:36:10,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e42cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:36:10, skipping insertion in model container
[2024-11-06 19:36:10,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:36:09" (3/3) ...
[2024-11-06 19:36:10,002 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label12.c
[2024-11-06 19:36:10,013 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-06 19:36:10,014 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-06 19:36:10,077 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-06 19:36:10,089 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@33af3513, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-06 19:36:10,090 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-06 19:36:10,095 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 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)
[2024-11-06 19:36:10,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2024-11-06 19:36:10,101 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-06 19:36:10,102 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 19:36:10,102 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 19:36:10,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 19:36:10,106 INFO L85 PathProgramCache]: Analyzing trace with hash -569068670, now seen corresponding path program 1 times
[2024-11-06 19:36:10,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-06 19:36:10,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698412757]
[2024-11-06 19:36:10,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 19:36:10,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-06 19:36:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 19:36:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-06 19:36:10,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-06 19:36:10,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698412757]
[2024-11-06 19:36:10,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698412757] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 19:36:10,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 19:36:10,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-06 19:36:10,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867519451]
[2024-11-06 19:36:10,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 19:36:10,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-06 19:36:10,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-06 19:36:10,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-06 19:36:10,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 19:36:10,344 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 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 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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)
[2024-11-06 19:36:11,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 19:36:11,085 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions.
[2024-11-06 19:36:11,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-06 19:36:11,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12
[2024-11-06 19:36:11,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 19:36:11,095 INFO L225 Difference]: With dead ends: 552
[2024-11-06 19:36:11,096 INFO L226 Difference]: Without dead ends: 282
[2024-11-06 19:36:11,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 19:36:11,101 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 151 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-06 19:36:11,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 120 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-06 19:36:11,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states.
[2024-11-06 19:36:11,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282.
[2024-11-06 19:36:11,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.3416370106761566) internal successors, (377), 281 states have internal predecessors, (377), 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)
[2024-11-06 19:36:11,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 377 transitions.
[2024-11-06 19:36:11,168 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 377 transitions. Word has length 12
[2024-11-06 19:36:11,168 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-06 19:36:11,168 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 377 transitions.
[2024-11-06 19:36:11,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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)
[2024-11-06 19:36:11,169 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions.
[2024-11-06 19:36:11,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2024-11-06 19:36:11,170 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-06 19:36:11,171 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 19:36:11,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-06 19:36:11,172 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 19:36:11,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 19:36:11,173 INFO L85 PathProgramCache]: Analyzing trace with hash -2131932466, now seen corresponding path program 1 times
[2024-11-06 19:36:11,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-06 19:36:11,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224749029]
[2024-11-06 19:36:11,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 19:36:11,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-06 19:36:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 19:36:11,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-06 19:36:11,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-06 19:36:11,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224749029]
[2024-11-06 19:36:11,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224749029] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 19:36:11,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 19:36:11,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-06 19:36:11,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910518965]
[2024-11-06 19:36:11,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 19:36:11,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-06 19:36:11,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-06 19:36:11,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-06 19:36:11,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 19:36:11,454 INFO L87 Difference]: Start difference. First operand 282 states and 377 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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)
[2024-11-06 19:36:11,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 19:36:11,923 INFO L93 Difference]: Finished difference Result 701 states and 967 transitions.
[2024-11-06 19:36:11,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-06 19:36:11,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78
[2024-11-06 19:36:11,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 19:36:11,928 INFO L225 Difference]: With dead ends: 701
[2024-11-06 19:36:11,930 INFO L226 Difference]: Without dead ends: 421
[2024-11-06 19:36:11,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 19:36:11,932 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 134 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-06 19:36:11,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 215 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-06 19:36:11,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states.
[2024-11-06 19:36:11,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421.
[2024-11-06 19:36:11,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.2523809523809524) internal successors, (526), 420 states have internal predecessors, (526), 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)
[2024-11-06 19:36:11,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 526 transitions.
[2024-11-06 19:36:11,958 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 526 transitions. Word has length 78
[2024-11-06 19:36:11,958 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-06 19:36:11,958 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 526 transitions.
[2024-11-06 19:36:11,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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)
[2024-11-06 19:36:11,958 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 526 transitions.
[2024-11-06 19:36:11,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2024-11-06 19:36:11,959 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-06 19:36:11,959 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 19:36:11,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-06 19:36:11,960 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 19:36:11,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 19:36:11,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1559391969, now seen corresponding path program 1 times
[2024-11-06 19:36:11,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-06 19:36:11,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696066903]
[2024-11-06 19:36:11,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 19:36:11,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-06 19:36:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 19:36:12,214 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-06 19:36:12,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-06 19:36:12,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696066903]
[2024-11-06 19:36:12,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696066903] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 19:36:12,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 19:36:12,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-06 19:36:12,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898636754]
[2024-11-06 19:36:12,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 19:36:12,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-06 19:36:12,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-06 19:36:12,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-06 19:36:12,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 19:36:12,217 INFO L87 Difference]: Start difference. First operand 421 states and 526 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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)
[2024-11-06 19:36:12,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 19:36:12,621 INFO L93 Difference]: Finished difference Result 979 states and 1209 transitions.
[2024-11-06 19:36:12,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-06 19:36:12,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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 85
[2024-11-06 19:36:12,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 19:36:12,626 INFO L225 Difference]: With dead ends: 979
[2024-11-06 19:36:12,626 INFO L226 Difference]: Without dead ends: 560
[2024-11-06 19:36:12,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 19:36:12,628 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-06 19:36:12,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 77 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-06 19:36:12,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states.
[2024-11-06 19:36:12,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560.
[2024-11-06 19:36:12,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.2075134168157424) internal successors, (675), 559 states have internal predecessors, (675), 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)
[2024-11-06 19:36:12,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 675 transitions.
[2024-11-06 19:36:12,643 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 675 transitions. Word has length 85
[2024-11-06 19:36:12,643 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-06 19:36:12,643 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 675 transitions.
[2024-11-06 19:36:12,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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)
[2024-11-06 19:36:12,644 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 675 transitions.
[2024-11-06 19:36:12,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2024-11-06 19:36:12,645 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-06 19:36:12,645 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 19:36:12,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-06 19:36:12,646 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 19:36:12,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 19:36:12,646 INFO L85 PathProgramCache]: Analyzing trace with hash 378189020, now seen corresponding path program 1 times
[2024-11-06 19:36:12,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-06 19:36:12,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412332764]
[2024-11-06 19:36:12,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 19:36:12,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-06 19:36:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 19:36:12,743 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-06 19:36:12,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-06 19:36:12,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412332764]
[2024-11-06 19:36:12,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412332764] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 19:36:12,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 19:36:12,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-06 19:36:12,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745420426]
[2024-11-06 19:36:12,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 19:36:12,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-06 19:36:12,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-06 19:36:12,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-06 19:36:12,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 19:36:12,746 INFO L87 Difference]: Start difference. First operand 560 states and 675 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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)
[2024-11-06 19:36:13,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 19:36:13,188 INFO L93 Difference]: Finished difference Result 1118 states and 1414 transitions.
[2024-11-06 19:36:13,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-06 19:36:13,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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 87
[2024-11-06 19:36:13,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 19:36:13,194 INFO L225 Difference]: With dead ends: 1118
[2024-11-06 19:36:13,194 INFO L226 Difference]: Without dead ends: 699
[2024-11-06 19:36:13,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 19:36:13,196 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 143 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-06 19:36:13,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 191 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-06 19:36:13,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states.
[2024-11-06 19:36:13,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699.
[2024-11-06 19:36:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2163323782234956) internal successors, (849), 698 states have internal predecessors, (849), 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)
[2024-11-06 19:36:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 849 transitions.
[2024-11-06 19:36:13,210 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 849 transitions. Word has length 87
[2024-11-06 19:36:13,210 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-06 19:36:13,211 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 849 transitions.
[2024-11-06 19:36:13,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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)
[2024-11-06 19:36:13,211 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 849 transitions.
[2024-11-06 19:36:13,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2024-11-06 19:36:13,213 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-06 19:36:13,213 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 19:36:13,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-06 19:36:13,214 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 19:36:13,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 19:36:13,214 INFO L85 PathProgramCache]: Analyzing trace with hash 420607156, now seen corresponding path program 1 times
[2024-11-06 19:36:13,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-06 19:36:13,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275395929]
[2024-11-06 19:36:13,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 19:36:13,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-06 19:36:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 19:36:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-06 19:36:13,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-06 19:36:13,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275395929]
[2024-11-06 19:36:13,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275395929] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 19:36:13,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 19:36:13,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-06 19:36:13,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565674853]
[2024-11-06 19:36:13,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 19:36:13,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-06 19:36:13,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-06 19:36:13,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-06 19:36:13,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 19:36:13,310 INFO L87 Difference]: Start difference. First operand 699 states and 849 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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)
[2024-11-06 19:36:13,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 19:36:13,737 INFO L93 Difference]: Finished difference Result 1535 states and 1880 transitions.
[2024-11-06 19:36:13,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-06 19:36:13,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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 103
[2024-11-06 19:36:13,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 19:36:13,741 INFO L225 Difference]: With dead ends: 1535
[2024-11-06 19:36:13,741 INFO L226 Difference]: Without dead ends: 977
[2024-11-06 19:36:13,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 19:36:13,743 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 87 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-06 19:36:13,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 34 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-06 19:36:13,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states.
[2024-11-06 19:36:13,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977.
[2024-11-06 19:36:13,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.1495901639344261) internal successors, (1122), 976 states have internal predecessors, (1122), 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)
[2024-11-06 19:36:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1122 transitions.
[2024-11-06 19:36:13,761 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1122 transitions. Word has length 103
[2024-11-06 19:36:13,761 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-06 19:36:13,761 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1122 transitions.
[2024-11-06 19:36:13,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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)
[2024-11-06 19:36:13,762 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1122 transitions.
[2024-11-06 19:36:13,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2024-11-06 19:36:13,764 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-06 19:36:13,764 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 19:36:13,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-06 19:36:13,765 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 19:36:13,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 19:36:13,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1242750265, now seen corresponding path program 1 times
[2024-11-06 19:36:13,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-06 19:36:13,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950894145]
[2024-11-06 19:36:13,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 19:36:13,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-06 19:36:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 19:36:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-06 19:36:14,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-06 19:36:14,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950894145]
[2024-11-06 19:36:14,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950894145] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 19:36:14,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 19:36:14,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-06 19:36:14,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553396025]
[2024-11-06 19:36:14,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 19:36:14,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-06 19:36:14,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-06 19:36:14,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-06 19:36:14,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2024-11-06 19:36:14,162 INFO L87 Difference]: Start difference. First operand 977 states and 1122 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 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)
[2024-11-06 19:36:14,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 19:36:14,598 INFO L93 Difference]: Finished difference Result 1868 states and 2153 transitions.
[2024-11-06 19:36:14,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-06 19:36:14,598 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 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 160
[2024-11-06 19:36:14,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 19:36:14,602 INFO L225 Difference]: With dead ends: 1868
[2024-11-06 19:36:14,604 INFO L226 Difference]: Without dead ends: 977
[2024-11-06 19:36:14,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2024-11-06 19:36:14,608 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-06 19:36:14,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 20 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-06 19:36:14,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states.
[2024-11-06 19:36:14,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977.
[2024-11-06 19:36:14,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.1454918032786885) internal successors, (1118), 976 states have internal predecessors, (1118), 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)
[2024-11-06 19:36:14,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1118 transitions.
[2024-11-06 19:36:14,634 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1118 transitions. Word has length 160
[2024-11-06 19:36:14,634 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-06 19:36:14,634 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1118 transitions.
[2024-11-06 19:36:14,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 6 states have internal predecessors, (160), 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)
[2024-11-06 19:36:14,634 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1118 transitions.
[2024-11-06 19:36:14,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197
[2024-11-06 19:36:14,637 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-06 19:36:14,637 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 19:36:14,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-06 19:36:14,637 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 19:36:14,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 19:36:14,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1657170463, now seen corresponding path program 1 times
[2024-11-06 19:36:14,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-06 19:36:14,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019372890]
[2024-11-06 19:36:14,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 19:36:14,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-06 19:36:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 19:36:14,940 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked.
[2024-11-06 19:36:14,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-06 19:36:14,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019372890]
[2024-11-06 19:36:14,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019372890] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-06 19:36:14,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645866094]
[2024-11-06 19:36:14,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 19:36:14,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-06 19:36:14,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-06 19:36:14,943 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-06 19:36:14,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-06 19:36:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 19:36:15,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-06 19:36:15,050 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 19:36:15,312 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked.
[2024-11-06 19:36:15,312 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-06 19:36:15,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645866094] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 19:36:15,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-06 19:36:15,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2024-11-06 19:36:15,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098255810]
[2024-11-06 19:36:15,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 19:36:15,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-06 19:36:15,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-06 19:36:15,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-06 19:36:15,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-06 19:36:15,314 INFO L87 Difference]: Start difference. First operand 977 states and 1118 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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)
[2024-11-06 19:36:15,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 19:36:15,748 INFO L93 Difference]: Finished difference Result 1535 states and 1759 transitions.
[2024-11-06 19:36:15,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-06 19:36:15,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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 196
[2024-11-06 19:36:15,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 19:36:15,753 INFO L225 Difference]: With dead ends: 1535
[2024-11-06 19:36:15,753 INFO L226 Difference]: Without dead ends: 1533
[2024-11-06 19:36:15,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-06 19:36:15,754 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-06 19:36:15,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 11 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-06 19:36:15,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states.
[2024-11-06 19:36:15,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1116.
[2024-11-06 19:36:15,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.1713004484304932) internal successors, (1306), 1115 states have internal predecessors, (1306), 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)
[2024-11-06 19:36:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1306 transitions.
[2024-11-06 19:36:15,774 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1306 transitions. Word has length 196
[2024-11-06 19:36:15,774 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-06 19:36:15,774 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1306 transitions.
[2024-11-06 19:36:15,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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)
[2024-11-06 19:36:15,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1306 transitions.
[2024-11-06 19:36:15,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261
[2024-11-06 19:36:15,777 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-06 19:36:15,777 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 19:36:15,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-11-06 19:36:15,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-06 19:36:15,978 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 19:36:15,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 19:36:15,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1440737983, now seen corresponding path program 1 times
[2024-11-06 19:36:15,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-06 19:36:15,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124867540]
[2024-11-06 19:36:15,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 19:36:15,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-06 19:36:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 19:36:16,226 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked.
[2024-11-06 19:36:16,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-06 19:36:16,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124867540]
[2024-11-06 19:36:16,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124867540] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 19:36:16,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 19:36:16,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-06 19:36:16,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163174588]
[2024-11-06 19:36:16,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 19:36:16,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-06 19:36:16,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-06 19:36:16,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-06 19:36:16,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 19:36:16,228 INFO L87 Difference]: Start difference. First operand 1116 states and 1306 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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)
[2024-11-06 19:36:16,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 19:36:16,649 INFO L93 Difference]: Finished difference Result 2369 states and 2844 transitions.
[2024-11-06 19:36:16,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-06 19:36:16,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 260
[2024-11-06 19:36:16,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 19:36:16,654 INFO L225 Difference]: With dead ends: 2369
[2024-11-06 19:36:16,654 INFO L226 Difference]: Without dead ends: 1394
[2024-11-06 19:36:16,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 19:36:16,656 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 130 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-06 19:36:16,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 225 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-06 19:36:16,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states.
[2024-11-06 19:36:16,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1255.
[2024-11-06 19:36:16,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.164274322169059) internal successors, (1460), 1254 states have internal predecessors, (1460), 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)
[2024-11-06 19:36:16,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1460 transitions.
[2024-11-06 19:36:16,679 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1460 transitions. Word has length 260
[2024-11-06 19:36:16,679 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-06 19:36:16,679 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1460 transitions.
[2024-11-06 19:36:16,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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)
[2024-11-06 19:36:16,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1460 transitions.
[2024-11-06 19:36:16,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312
[2024-11-06 19:36:16,687 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-06 19:36:16,687 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 19:36:16,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-06 19:36:16,687 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 19:36:16,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 19:36:16,688 INFO L85 PathProgramCache]: Analyzing trace with hash 768627641, now seen corresponding path program 1 times
[2024-11-06 19:36:16,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-06 19:36:16,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463307813]
[2024-11-06 19:36:16,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 19:36:16,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-06 19:36:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 19:36:17,400 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 205 proven. 7 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked.
[2024-11-06 19:36:17,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-06 19:36:17,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463307813]
[2024-11-06 19:36:17,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463307813] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-06 19:36:17,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559499309]
[2024-11-06 19:36:17,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 19:36:17,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-06 19:36:17,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-06 19:36:17,408 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-06 19:36:17,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-06 19:36:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 19:36:17,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-06 19:36:17,581 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 19:36:18,036 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2024-11-06 19:36:18,037 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-06 19:36:18,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559499309] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 19:36:18,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-06 19:36:18,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7
[2024-11-06 19:36:18,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709312264]
[2024-11-06 19:36:18,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 19:36:18,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-06 19:36:18,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-06 19:36:18,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-06 19:36:18,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-11-06 19:36:18,039 INFO L87 Difference]: Start difference. First operand 1255 states and 1460 transitions. Second operand has 4 states, 4 states have (on average 75.5) internal successors, (302), 3 states have internal predecessors, (302), 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)
[2024-11-06 19:36:18,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 19:36:18,838 INFO L93 Difference]: Finished difference Result 3898 states and 4561 transitions.
[2024-11-06 19:36:18,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-06 19:36:18,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.5) internal successors, (302), 3 states have internal predecessors, (302), 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 311
[2024-11-06 19:36:18,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 19:36:18,849 INFO L225 Difference]: With dead ends: 3898
[2024-11-06 19:36:18,849 INFO L226 Difference]: Without dead ends: 2784
[2024-11-06 19:36:18,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-11-06 19:36:18,852 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 108 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-06 19:36:18,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 55 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-06 19:36:18,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states.
[2024-11-06 19:36:18,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2367.
[2024-11-06 19:36:18,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2367 states, 2366 states have (on average 1.1369399830938292) internal successors, (2690), 2366 states have internal predecessors, (2690), 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)
[2024-11-06 19:36:18,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 2690 transitions.
[2024-11-06 19:36:18,902 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 2690 transitions. Word has length 311
[2024-11-06 19:36:18,903 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-06 19:36:18,903 INFO L471 AbstractCegarLoop]: Abstraction has 2367 states and 2690 transitions.
[2024-11-06 19:36:18,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.5) internal successors, (302), 3 states have internal predecessors, (302), 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)
[2024-11-06 19:36:18,903 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 2690 transitions.
[2024-11-06 19:36:18,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331
[2024-11-06 19:36:18,908 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-06 19:36:18,908 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 19:36:18,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-06 19:36:19,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-06 19:36:19,113 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 19:36:19,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 19:36:19,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1928090779, now seen corresponding path program 1 times
[2024-11-06 19:36:19,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-06 19:36:19,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498017880]
[2024-11-06 19:36:19,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 19:36:19,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-06 19:36:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 19:36:19,775 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 205 proven. 11 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked.
[2024-11-06 19:36:19,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-06 19:36:19,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498017880]
[2024-11-06 19:36:19,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498017880] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-06 19:36:19,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882130851]
[2024-11-06 19:36:19,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 19:36:19,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-06 19:36:19,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-06 19:36:19,778 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-06 19:36:19,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-06 19:36:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 19:36:19,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-06 19:36:19,891 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 19:36:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 101 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-06 19:36:20,540 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-06 19:36:21,559 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked.
[2024-11-06 19:36:21,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882130851] provided 1 perfect and 1 imperfect interpolant sequences
[2024-11-06 19:36:21,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2024-11-06 19:36:21,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 10
[2024-11-06 19:36:21,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679852187]
[2024-11-06 19:36:21,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 19:36:21,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-06 19:36:21,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-06 19:36:21,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-06 19:36:21,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-11-06 19:36:21,561 INFO L87 Difference]: Start difference. First operand 2367 states and 2690 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 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)
[2024-11-06 19:36:22,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 19:36:22,025 INFO L93 Difference]: Finished difference Result 4732 states and 5389 transitions.
[2024-11-06 19:36:22,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-06 19:36:22,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 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 330
[2024-11-06 19:36:22,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 19:36:22,035 INFO L225 Difference]: With dead ends: 4732
[2024-11-06 19:36:22,035 INFO L226 Difference]: Without dead ends: 2506
[2024-11-06 19:36:22,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 655 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-11-06 19:36:22,041 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 35 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-06 19:36:22,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 14 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-06 19:36:22,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states.
[2024-11-06 19:36:22,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2506.
[2024-11-06 19:36:22,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2506 states, 2505 states have (on average 1.1253493013972056) internal successors, (2819), 2505 states have internal predecessors, (2819), 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)
[2024-11-06 19:36:22,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 2819 transitions.
[2024-11-06 19:36:22,094 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 2819 transitions. Word has length 330
[2024-11-06 19:36:22,095 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-06 19:36:22,095 INFO L471 AbstractCegarLoop]: Abstraction has 2506 states and 2819 transitions.
[2024-11-06 19:36:22,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 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)
[2024-11-06 19:36:22,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 2819 transitions.
[2024-11-06 19:36:22,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341
[2024-11-06 19:36:22,100 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-06 19:36:22,100 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 19:36:22,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-11-06 19:36:22,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-06 19:36:22,303 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 19:36:22,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 19:36:22,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1403919586, now seen corresponding path program 1 times
[2024-11-06 19:36:22,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-06 19:36:22,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331046892]
[2024-11-06 19:36:22,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 19:36:22,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-06 19:36:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-06 19:36:22,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-06 19:36:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-06 19:36:22,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-06 19:36:22,586 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-06 19:36:22,587 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-06 19:36:22,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-06 19:36:22,591 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 19:36:22,694 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-06 19:36:22,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:36:22 BoogieIcfgContainer
[2024-11-06 19:36:22,696 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-06 19:36:22,697 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-06 19:36:22,697 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-06 19:36:22,697 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-06 19:36:22,698 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:36:09" (3/4) ...
[2024-11-06 19:36:22,699 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-06 19:36:22,828 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-06 19:36:22,828 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-06 19:36:22,830 INFO L158 Benchmark]: Toolchain (without parser) took 14445.63ms. Allocated memory was 100.7MB in the beginning and 352.3MB in the end (delta: 251.7MB). Free memory was 75.4MB in the beginning and 230.0MB in the end (delta: -154.7MB). Peak memory consumption was 93.5MB. Max. memory is 16.1GB.
[2024-11-06 19:36:22,830 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 83.9MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-06 19:36:22,830 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.30ms. Allocated memory is still 100.7MB. Free memory was 75.1MB in the beginning and 48.1MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-06 19:36:22,831 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.39ms. Allocated memory is still 100.7MB. Free memory was 48.1MB in the beginning and 40.4MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-06 19:36:22,831 INFO L158 Benchmark]: Boogie Preprocessor took 124.91ms. Allocated memory is still 100.7MB. Free memory was 40.4MB in the beginning and 66.4MB in the end (delta: -26.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2024-11-06 19:36:22,831 INFO L158 Benchmark]: RCFGBuilder took 1039.02ms. Allocated memory is still 100.7MB. Free memory was 66.4MB in the beginning and 49.2MB in the end (delta: 17.2MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB.
[2024-11-06 19:36:22,832 INFO L158 Benchmark]: TraceAbstraction took 12699.53ms. Allocated memory was 100.7MB in the beginning and 352.3MB in the end (delta: 251.7MB). Free memory was 48.7MB in the beginning and 255.2MB in the end (delta: -206.6MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB.
[2024-11-06 19:36:22,832 INFO L158 Benchmark]: Witness Printer took 131.28ms. Allocated memory is still 352.3MB. Free memory was 255.2MB in the beginning and 230.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-06 19:36:22,833 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.39ms. Allocated memory is still 83.9MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 375.30ms. Allocated memory is still 100.7MB. Free memory was 75.1MB in the beginning and 48.1MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 70.39ms. Allocated memory is still 100.7MB. Free memory was 48.1MB in the beginning and 40.4MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 124.91ms. Allocated memory is still 100.7MB. Free memory was 40.4MB in the beginning and 66.4MB in the end (delta: -26.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
* RCFGBuilder took 1039.02ms. Allocated memory is still 100.7MB. Free memory was 66.4MB in the beginning and 49.2MB in the end (delta: 17.2MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB.
* TraceAbstraction took 12699.53ms. Allocated memory was 100.7MB in the beginning and 352.3MB in the end (delta: 251.7MB). Free memory was 48.7MB in the beginning and 255.2MB in the end (delta: -206.6MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB.
* Witness Printer took 131.28ms. Allocated memory is still 352.3MB. Free memory was 255.2MB in the beginning and 230.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. 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
- CounterExampleResult [Line: 50]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L17] int inputC = 3;
[L18] int inputD = 4;
[L19] int inputE = 5;
[L20] int inputF = 6;
[L21] int inputB = 2;
[L24] int a1 = 23;
[L25] int a19 = 9;
[L26] int a10 = 0;
[L27] int a12 = 0;
[L28] int a4 = 14;
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L589] int output = -1;
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L592] COND TRUE 1
[L595] int input;
[L596] input = __VERIFIER_nondet_int()
[L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L600] CALL, EXPR calculate_output(input)
[L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 ))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14))))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3)))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 )))))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 ))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14)))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14)))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L370] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)))))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L375] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0)))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L380] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L385] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L388] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L393] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L398] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0)))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L403] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L408] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L413] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L418] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2)))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L424] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L429] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10))))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L435] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L440] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L446] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L452] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L458] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L464] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L470] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0)))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L475] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14)))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L481] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L486] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L491] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L497] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L503] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L509] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L514] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L519] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L524] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L527] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10)))))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L533] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14)))
VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L536] COND TRUE ((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))
[L537] a1 = (((a1 * 5) + 278443) - -239546)
[L538] return 26;
VAL [\result=26, a10=0, a12=0, a19=9, a1=518104, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L600] RET, EXPR calculate_output(input)
[L600] output = calculate_output(input)
[L592] COND TRUE 1
[L595] int input;
[L596] input = __VERIFIER_nondet_int()
[L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L600] CALL, EXPR calculate_output(input)
[L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 ))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14))))))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0))))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3)))))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9))))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0))))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 )))))))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 ))))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0)))
VAL [a10=0, a12=0, a19=9, a1=518104, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L306] COND TRUE ((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))
[L307] a1 = ((((((a1 * 9)/ 10) % 299993)+ -300005) / 5) + -75819)
[L308] a10 = 4
[L310] return 26;
VAL [\result=26, a10=4, a12=0, a19=9, a1=-102560, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L600] RET, EXPR calculate_output(input)
[L600] output = calculate_output(input)
[L592] COND TRUE 1
[L595] int input;
[L596] input = __VERIFIER_nondet_int()
[L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L600] CALL, EXPR calculate_output(input)
[L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 ))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14))))))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0))))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3)))))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9))))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0))))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 )))))))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 ))))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0))))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2))))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14)))))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14)))))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L370] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)))))))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L375] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0)))))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L380] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L385] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4))))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L388] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L393] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L398] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0)))))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L403] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14))))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L408] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14))))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L413] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L418] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2)))))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L424] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L429] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10))))))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L435] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L440] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L446] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14))))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L452] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14)))
VAL [a10=4, a12=0, a19=9, a1=-102560, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L458] COND TRUE ((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))
[L459] a1 = ((((((a1 % 25)- -12) - 0) * 5) % 25)- -13)
[L460] a10 = 3
[L461] a19 = 6
[L463] return -1;
VAL [\result=-1, a10=3, a12=0, a19=6, a1=23, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L600] RET, EXPR calculate_output(input)
[L600] output = calculate_output(input)
[L592] COND TRUE 1
[L595] int input;
[L596] input = __VERIFIER_nondet_int()
[L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L600] CALL calculate_output(input)
[L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=3, a12=0, a19=6, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8)))
VAL [a10=3, a12=0, a19=6, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [a10=3, a12=0, a19=6, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)))
VAL [a10=3, a12=0, a19=6, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)))
VAL [a10=3, a12=0, a19=6, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)))
VAL [a10=3, a12=0, a19=6, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L49] COND TRUE (((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))
VAL [a10=3, a12=0, a19=6, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L50] reach_error()
VAL [a10=3, a12=0, a19=6, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.5s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1066 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1066 mSDsluCounter, 962 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 637 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4193 IncrementalHoareTripleChecker+Invalid, 4830 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 637 mSolverCounterUnsat, 905 mSDtfsCounter, 4193 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1197 GetRequests, 1169 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2506occurred in iteration=10, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 973 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 2799 NumberOfCodeBlocks, 2799 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2775 ConstructedInterpolants, 0 QuantifiedInterpolants, 16521 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1186 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 1612/1870 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 proved your program to be incorrect!
[2024-11-06 19:36:22,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE