./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX --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 64bit --witnessprinter.graph.data.programhash fb8ca5e5ce2ed40fdd0ad3d69b0bd96c83a6daf11d842e9766da8dc50e36012a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:41:50,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:41:50,144 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-08 18:41:50,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:41:50,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:41:50,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:41:50,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:41:50,201 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:41:50,202 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:41:50,202 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:41:50,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:41:50,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:41:50,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:41:50,207 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:41:50,207 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:41:50,207 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:41:50,208 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:41:50,208 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:41:50,208 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:41:50,209 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:41:50,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:41:50,213 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:41:50,213 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:41:50,213 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:41:50,214 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:41:50,214 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:41:50,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:41:50,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:41:50,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:41:50,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:41:50,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:41:50,225 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:41:50,225 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:41:50,226 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:41:50,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:41:50,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:41:50,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:41:50,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:41:50,227 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:41:50,227 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fb8ca5e5ce2ed40fdd0ad3d69b0bd96c83a6daf11d842e9766da8dc50e36012a [2024-11-08 18:41:50,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:41:50,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:41:50,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:41:50,586 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:41:50,586 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:41:50,587 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c Unable to find full path for "g++" [2024-11-08 18:41:52,497 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:41:52,737 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:41:52,738 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c [2024-11-08 18:41:52,750 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/data/3be3b90c9/9d9b71d8b6b8481194cac7cb36d704b5/FLAGdb6253289 [2024-11-08 18:41:52,771 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/data/3be3b90c9/9d9b71d8b6b8481194cac7cb36d704b5 [2024-11-08 18:41:52,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:41:52,778 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:41:52,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:41:52,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:41:52,785 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:41:52,786 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:41:52" (1/1) ... [2024-11-08 18:41:52,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44d79ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:52, skipping insertion in model container [2024-11-08 18:41:52,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:41:52" (1/1) ... [2024-11-08 18:41:52,846 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:41:53,062 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c[1255,1268] [2024-11-08 18:41:53,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:41:53,118 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:41:53,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c[1255,1268] [2024-11-08 18:41:53,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:41:53,183 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:41:53,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:53 WrapperNode [2024-11-08 18:41:53,184 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:41:53,185 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:41:53,185 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:41:53,186 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:41:53,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:53" (1/1) ... [2024-11-08 18:41:53,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:53" (1/1) ... [2024-11-08 18:41:53,257 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 189 [2024-11-08 18:41:53,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:41:53,258 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:41:53,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:41:53,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:41:53,271 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:53" (1/1) ... [2024-11-08 18:41:53,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:53" (1/1) ... [2024-11-08 18:41:53,282 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:53" (1/1) ... [2024-11-08 18:41:53,300 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-08 18:41:53,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:53" (1/1) ... [2024-11-08 18:41:53,301 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:53" (1/1) ... [2024-11-08 18:41:53,312 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:53" (1/1) ... [2024-11-08 18:41:53,320 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:53" (1/1) ... [2024-11-08 18:41:53,330 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:53" (1/1) ... [2024-11-08 18:41:53,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:53" (1/1) ... [2024-11-08 18:41:53,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:41:53,340 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:41:53,341 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:41:53,341 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:41:53,342 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:53" (1/1) ... [2024-11-08 18:41:53,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:41:53,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:41:53,371 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:41:53,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:41:53,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:41:53,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:41:53,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:41:53,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:41:53,530 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:41:53,533 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:41:54,000 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-11-08 18:41:54,002 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:41:54,017 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:41:54,018 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:41:54,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:41:54 BoogieIcfgContainer [2024-11-08 18:41:54,020 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:41:54,022 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:41:54,023 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:41:54,027 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:41:54,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:41:52" (1/3) ... [2024-11-08 18:41:54,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59331b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:41:54, skipping insertion in model container [2024-11-08 18:41:54,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:41:53" (2/3) ... [2024-11-08 18:41:54,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59331b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:41:54, skipping insertion in model container [2024-11-08 18:41:54,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:41:54" (3/3) ... [2024-11-08 18:41:54,031 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cav14_example_v.c [2024-11-08 18:41:54,044 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:41:54,044 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:41:54,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:41:54,110 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;@273b6593, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:41:54,111 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:41:54,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 49 states have (on average 1.489795918367347) internal successors, (73), 50 states have internal predecessors, (73), 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-08 18:41:54,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 18:41:54,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:41:54,122 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:41:54,123 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:41:54,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:41:54,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1456516445, now seen corresponding path program 1 times [2024-11-08 18:41:54,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:41:54,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187142160] [2024-11-08 18:41:54,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:41:54,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:41:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:54,719 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-08 18:41:54,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:41:54,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187142160] [2024-11-08 18:41:54,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187142160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:41:54,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:41:54,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:41:54,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697337322] [2024-11-08 18:41:54,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:41:54,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:41:54,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:41:54,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:41:54,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:41:54,762 INFO L87 Difference]: Start difference. First operand has 51 states, 49 states have (on average 1.489795918367347) internal successors, (73), 50 states have internal predecessors, (73), 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 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-08 18:41:54,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:41:54,818 INFO L93 Difference]: Finished difference Result 90 states and 132 transitions. [2024-11-08 18:41:54,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:41:54,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-08 18:41:54,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:41:54,831 INFO L225 Difference]: With dead ends: 90 [2024-11-08 18:41:54,832 INFO L226 Difference]: Without dead ends: 49 [2024-11-08 18:41:54,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:41:54,839 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:41:54,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 189 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:41:54,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-08 18:41:54,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-08 18:41:54,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 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-08 18:41:54,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2024-11-08 18:41:54,887 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 13 [2024-11-08 18:41:54,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:41:54,889 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2024-11-08 18:41:54,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-08 18:41:54,890 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2024-11-08 18:41:54,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 18:41:54,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:41:54,891 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:41:54,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:41:54,892 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:41:54,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:41:54,894 INFO L85 PathProgramCache]: Analyzing trace with hash 2094325670, now seen corresponding path program 1 times [2024-11-08 18:41:54,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:41:54,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550270213] [2024-11-08 18:41:54,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:41:54,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:41:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:55,106 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-08 18:41:55,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:41:55,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550270213] [2024-11-08 18:41:55,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550270213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:41:55,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:41:55,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:41:55,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396598051] [2024-11-08 18:41:55,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:41:55,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:41:55,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:41:55,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:41:55,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:41:55,112 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-08 18:41:55,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:41:55,168 INFO L93 Difference]: Finished difference Result 90 states and 127 transitions. [2024-11-08 18:41:55,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:41:55,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2024-11-08 18:41:55,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:41:55,170 INFO L225 Difference]: With dead ends: 90 [2024-11-08 18:41:55,170 INFO L226 Difference]: Without dead ends: 51 [2024-11-08 18:41:55,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:41:55,172 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:41:55,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:41:55,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-08 18:41:55,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-08 18:41:55,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 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-08 18:41:55,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2024-11-08 18:41:55,178 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 14 [2024-11-08 18:41:55,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:41:55,178 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2024-11-08 18:41:55,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-08 18:41:55,179 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2024-11-08 18:41:55,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 18:41:55,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:41:55,180 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:41:55,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:41:55,180 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:41:55,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:41:55,182 INFO L85 PathProgramCache]: Analyzing trace with hash -598379556, now seen corresponding path program 1 times [2024-11-08 18:41:55,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:41:55,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501362460] [2024-11-08 18:41:55,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:41:55,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:41:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:55,491 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-08 18:41:55,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:41:55,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501362460] [2024-11-08 18:41:55,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501362460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:41:55,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:41:55,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:41:55,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863239746] [2024-11-08 18:41:55,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:41:55,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:41:55,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:41:55,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:41:55,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:41:55,493 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-08 18:41:55,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:41:55,571 INFO L93 Difference]: Finished difference Result 119 states and 166 transitions. [2024-11-08 18:41:55,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:41:55,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2024-11-08 18:41:55,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:41:55,573 INFO L225 Difference]: With dead ends: 119 [2024-11-08 18:41:55,573 INFO L226 Difference]: Without dead ends: 78 [2024-11-08 18:41:55,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:41:55,575 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 44 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:41:55,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 221 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:41:55,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-08 18:41:55,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 53. [2024-11-08 18:41:55,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 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-08 18:41:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 73 transitions. [2024-11-08 18:41:55,581 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 73 transitions. Word has length 15 [2024-11-08 18:41:55,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:41:55,582 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 73 transitions. [2024-11-08 18:41:55,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-08 18:41:55,582 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2024-11-08 18:41:55,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 18:41:55,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:41:55,583 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 18:41:55,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:41:55,584 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:41:55,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:41:55,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1328443764, now seen corresponding path program 1 times [2024-11-08 18:41:55,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:41:55,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140773777] [2024-11-08 18:41:55,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:41:55,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:41:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:56,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:41:56,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:41:56,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140773777] [2024-11-08 18:41:56,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140773777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:41:56,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:41:56,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:41:56,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755364086] [2024-11-08 18:41:56,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:41:56,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:41:56,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:41:56,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:41:56,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:41:56,349 INFO L87 Difference]: Start difference. First operand 53 states and 73 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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-08 18:41:56,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:41:56,513 INFO L93 Difference]: Finished difference Result 144 states and 201 transitions. [2024-11-08 18:41:56,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:41:56,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 34 [2024-11-08 18:41:56,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:41:56,515 INFO L225 Difference]: With dead ends: 144 [2024-11-08 18:41:56,515 INFO L226 Difference]: Without dead ends: 103 [2024-11-08 18:41:56,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:41:56,517 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 60 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:41:56,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 453 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:41:56,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-08 18:41:56,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 64. [2024-11-08 18:41:56,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 63 states have internal predecessors, (89), 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-08 18:41:56,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2024-11-08 18:41:56,529 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 34 [2024-11-08 18:41:56,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:41:56,530 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2024-11-08 18:41:56,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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-08 18:41:56,534 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2024-11-08 18:41:56,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 18:41:56,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:41:56,535 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 18:41:56,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:41:56,536 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:41:56,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:41:56,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1477590325, now seen corresponding path program 1 times [2024-11-08 18:41:56,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:41:56,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819933250] [2024-11-08 18:41:56,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:41:56,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:41:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:57,077 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:41:57,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:41:57,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819933250] [2024-11-08 18:41:57,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819933250] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:41:57,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672182796] [2024-11-08 18:41:57,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:41:57,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:41:57,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:41:57,083 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:41:57,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 18:41:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:57,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 18:41:57,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:41:57,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:41:57,550 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:41:57,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672182796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:41:57,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:41:57,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-11-08 18:41:57,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339551426] [2024-11-08 18:41:57,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:41:57,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:41:57,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:41:57,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:41:57,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:41:57,553 INFO L87 Difference]: Start difference. First operand 64 states and 89 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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-08 18:41:57,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:41:57,741 INFO L93 Difference]: Finished difference Result 157 states and 219 transitions. [2024-11-08 18:41:57,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:41:57,742 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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 35 [2024-11-08 18:41:57,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:41:57,745 INFO L225 Difference]: With dead ends: 157 [2024-11-08 18:41:57,747 INFO L226 Difference]: Without dead ends: 103 [2024-11-08 18:41:57,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-11-08 18:41:57,748 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 133 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:41:57,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 131 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:41:57,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-08 18:41:57,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 76. [2024-11-08 18:41:57,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 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-08 18:41:57,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2024-11-08 18:41:57,764 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 35 [2024-11-08 18:41:57,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:41:57,764 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2024-11-08 18:41:57,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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-08 18:41:57,764 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2024-11-08 18:41:57,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 18:41:57,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:41:57,768 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 18:41:57,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 18:41:57,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:41:57,969 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:41:57,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:41:57,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1997204272, now seen corresponding path program 1 times [2024-11-08 18:41:57,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:41:57,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384572418] [2024-11-08 18:41:57,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:41:57,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:41:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:58,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:41:58,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:41:58,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384572418] [2024-11-08 18:41:58,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384572418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:41:58,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:41:58,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:41:58,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458317208] [2024-11-08 18:41:58,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:41:58,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:41:58,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:41:58,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:41:58,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:41:58,654 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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-08 18:41:58,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:41:58,800 INFO L93 Difference]: Finished difference Result 163 states and 225 transitions. [2024-11-08 18:41:58,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:41:58,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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 36 [2024-11-08 18:41:58,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:41:58,801 INFO L225 Difference]: With dead ends: 163 [2024-11-08 18:41:58,801 INFO L226 Difference]: Without dead ends: 109 [2024-11-08 18:41:58,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:41:58,803 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 27 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:41:58,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 182 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:41:58,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-08 18:41:58,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2024-11-08 18:41:58,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.386138613861386) internal successors, (140), 101 states have internal predecessors, (140), 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-08 18:41:58,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 140 transitions. [2024-11-08 18:41:58,810 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 140 transitions. Word has length 36 [2024-11-08 18:41:58,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:41:58,811 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 140 transitions. [2024-11-08 18:41:58,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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-08 18:41:58,811 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 140 transitions. [2024-11-08 18:41:58,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 18:41:58,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:41:58,812 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 18:41:58,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 18:41:58,813 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:41:58,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:41:58,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1072579259, now seen corresponding path program 1 times [2024-11-08 18:41:58,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:41:58,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516127640] [2024-11-08 18:41:58,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:41:58,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:41:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:41:59,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:41:59,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:41:59,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516127640] [2024-11-08 18:41:59,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516127640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:41:59,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:41:59,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:41:59,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554538900] [2024-11-08 18:41:59,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:41:59,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:41:59,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:41:59,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:41:59,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:41:59,646 INFO L87 Difference]: Start difference. First operand 102 states and 140 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-08 18:41:59,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:41:59,860 INFO L93 Difference]: Finished difference Result 176 states and 243 transitions. [2024-11-08 18:41:59,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:41:59,861 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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 36 [2024-11-08 18:41:59,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:41:59,862 INFO L225 Difference]: With dead ends: 176 [2024-11-08 18:41:59,862 INFO L226 Difference]: Without dead ends: 111 [2024-11-08 18:41:59,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:41:59,863 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 47 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:41:59,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 203 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:41:59,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-08 18:41:59,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 104. [2024-11-08 18:41:59,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3786407766990292) internal successors, (142), 103 states have internal predecessors, (142), 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-08 18:41:59,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 142 transitions. [2024-11-08 18:41:59,871 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 142 transitions. Word has length 36 [2024-11-08 18:41:59,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:41:59,871 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 142 transitions. [2024-11-08 18:41:59,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-08 18:41:59,871 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 142 transitions. [2024-11-08 18:41:59,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 18:41:59,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:41:59,873 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 18:41:59,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 18:41:59,873 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:41:59,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:41:59,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1491106816, now seen corresponding path program 1 times [2024-11-08 18:41:59,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:41:59,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286708310] [2024-11-08 18:41:59,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:41:59,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:41:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:42:00,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:42:00,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:42:00,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286708310] [2024-11-08 18:42:00,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286708310] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:42:00,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204310070] [2024-11-08 18:42:00,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:42:00,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:42:00,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:42:00,419 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:42:00,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 18:42:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:42:00,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-08 18:42:00,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:42:01,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:42:01,003 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:42:01,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204310070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:42:01,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:42:01,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-11-08 18:42:01,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107651873] [2024-11-08 18:42:01,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:42:01,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:42:01,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:42:01,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:42:01,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:42:01,005 INFO L87 Difference]: Start difference. First operand 104 states and 142 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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-08 18:42:01,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:42:01,239 INFO L93 Difference]: Finished difference Result 170 states and 234 transitions. [2024-11-08 18:42:01,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:42:01,240 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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 37 [2024-11-08 18:42:01,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:42:01,241 INFO L225 Difference]: With dead ends: 170 [2024-11-08 18:42:01,241 INFO L226 Difference]: Without dead ends: 116 [2024-11-08 18:42:01,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-08 18:42:01,242 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 139 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:42:01,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 99 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:42:01,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-08 18:42:01,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2024-11-08 18:42:01,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.3831775700934579) internal successors, (148), 107 states have internal predecessors, (148), 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-08 18:42:01,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 148 transitions. [2024-11-08 18:42:01,248 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 148 transitions. Word has length 37 [2024-11-08 18:42:01,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:42:01,248 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 148 transitions. [2024-11-08 18:42:01,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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-08 18:42:01,249 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 148 transitions. [2024-11-08 18:42:01,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 18:42:01,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:42:01,250 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 18:42:01,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 18:42:01,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:42:01,451 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:42:01,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:42:01,451 INFO L85 PathProgramCache]: Analyzing trace with hash -361557188, now seen corresponding path program 1 times [2024-11-08 18:42:01,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:42:01,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635381312] [2024-11-08 18:42:01,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:42:01,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:42:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:42:01,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:42:01,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:42:01,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635381312] [2024-11-08 18:42:01,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635381312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:42:01,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:42:01,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:42:01,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97589708] [2024-11-08 18:42:01,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:42:01,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:42:01,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:42:01,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:42:01,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:42:01,883 INFO L87 Difference]: Start difference. First operand 108 states and 148 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-08 18:42:02,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:42:02,096 INFO L93 Difference]: Finished difference Result 205 states and 284 transitions. [2024-11-08 18:42:02,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:42:02,096 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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 37 [2024-11-08 18:42:02,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:42:02,097 INFO L225 Difference]: With dead ends: 205 [2024-11-08 18:42:02,097 INFO L226 Difference]: Without dead ends: 138 [2024-11-08 18:42:02,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:42:02,098 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 170 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:42:02,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 261 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:42:02,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-08 18:42:02,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2024-11-08 18:42:02,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.371900826446281) internal successors, (166), 121 states have internal predecessors, (166), 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-08 18:42:02,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 166 transitions. [2024-11-08 18:42:02,119 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 166 transitions. Word has length 37 [2024-11-08 18:42:02,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:42:02,120 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 166 transitions. [2024-11-08 18:42:02,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-08 18:42:02,120 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 166 transitions. [2024-11-08 18:42:02,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 18:42:02,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:42:02,122 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 18:42:02,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 18:42:02,122 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:42:02,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:42:02,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1739506909, now seen corresponding path program 1 times [2024-11-08 18:42:02,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:42:02,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227662463] [2024-11-08 18:42:02,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:42:02,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:42:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:42:02,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:42:02,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:42:02,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227662463] [2024-11-08 18:42:02,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227662463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:42:02,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:42:02,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:42:02,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770050025] [2024-11-08 18:42:02,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:42:02,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:42:02,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:42:02,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:42:02,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:42:02,489 INFO L87 Difference]: Start difference. First operand 122 states and 166 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-08 18:42:02,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:42:02,545 INFO L93 Difference]: Finished difference Result 194 states and 263 transitions. [2024-11-08 18:42:02,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:42:02,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2024-11-08 18:42:02,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:42:02,547 INFO L225 Difference]: With dead ends: 194 [2024-11-08 18:42:02,547 INFO L226 Difference]: Without dead ends: 93 [2024-11-08 18:42:02,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:42:02,548 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 26 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:42:02,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 222 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:42:02,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-08 18:42:02,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2024-11-08 18:42:02,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 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-08 18:42:02,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2024-11-08 18:42:02,552 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 37 [2024-11-08 18:42:02,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:42:02,553 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2024-11-08 18:42:02,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-08 18:42:02,553 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2024-11-08 18:42:02,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 18:42:02,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:42:02,554 INFO L215 NwaCegarLoop]: trace histogram [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-08 18:42:02,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 18:42:02,554 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:42:02,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:42:02,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1125018516, now seen corresponding path program 1 times [2024-11-08 18:42:02,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:42:02,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868796819] [2024-11-08 18:42:02,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:42:02,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:42:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:42:02,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:42:02,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:42:02,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868796819] [2024-11-08 18:42:02,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868796819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:42:02,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:42:02,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:42:02,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44957137] [2024-11-08 18:42:02,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:42:02,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:42:02,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:42:02,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:42:02,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:42:02,989 INFO L87 Difference]: Start difference. First operand 91 states and 120 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-08 18:42:03,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:42:03,093 INFO L93 Difference]: Finished difference Result 184 states and 250 transitions. [2024-11-08 18:42:03,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:42:03,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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 38 [2024-11-08 18:42:03,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:42:03,094 INFO L225 Difference]: With dead ends: 184 [2024-11-08 18:42:03,094 INFO L226 Difference]: Without dead ends: 130 [2024-11-08 18:42:03,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:42:03,095 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 56 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:42:03,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 451 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:42:03,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-08 18:42:03,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 93. [2024-11-08 18:42:03,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 92 states have internal predecessors, (123), 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-08 18:42:03,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 123 transitions. [2024-11-08 18:42:03,099 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 123 transitions. Word has length 38 [2024-11-08 18:42:03,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:42:03,100 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 123 transitions. [2024-11-08 18:42:03,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-08 18:42:03,100 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2024-11-08 18:42:03,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-08 18:42:03,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:42:03,101 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-08 18:42:03,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 18:42:03,102 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:42:03,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:42:03,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1689064064, now seen corresponding path program 1 times [2024-11-08 18:42:03,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:42:03,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427320594] [2024-11-08 18:42:03,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:42:03,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:42:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:42:04,242 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:42:04,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:42:04,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427320594] [2024-11-08 18:42:04,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427320594] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:42:04,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871850146] [2024-11-08 18:42:04,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:42:04,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:42:04,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:42:04,245 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:42:04,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 18:42:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:42:04,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-08 18:42:04,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:42:05,304 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:42:05,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:42:06,683 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:42:06,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871850146] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:42:06,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:42:06,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 18] total 39 [2024-11-08 18:42:06,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534086249] [2024-11-08 18:42:06,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:42:06,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-08 18:42:06,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:42:06,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-08 18:42:06,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1231, Unknown=0, NotChecked=0, Total=1482 [2024-11-08 18:42:06,688 INFO L87 Difference]: Start difference. First operand 93 states and 123 transitions. Second operand has 39 states, 39 states have (on average 3.948717948717949) internal successors, (154), 39 states have internal predecessors, (154), 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-08 18:42:09,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:42:09,362 INFO L93 Difference]: Finished difference Result 252 states and 347 transitions. [2024-11-08 18:42:09,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-08 18:42:09,362 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.948717948717949) internal successors, (154), 39 states have internal predecessors, (154), 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 57 [2024-11-08 18:42:09,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:42:09,363 INFO L225 Difference]: With dead ends: 252 [2024-11-08 18:42:09,363 INFO L226 Difference]: Without dead ends: 196 [2024-11-08 18:42:09,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1947 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1270, Invalid=6920, Unknown=0, NotChecked=0, Total=8190 [2024-11-08 18:42:09,367 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 650 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:42:09,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 775 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 18:42:09,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-08 18:42:09,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 145. [2024-11-08 18:42:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.3125) internal successors, (189), 144 states have internal predecessors, (189), 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-08 18:42:09,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 189 transitions. [2024-11-08 18:42:09,373 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 189 transitions. Word has length 57 [2024-11-08 18:42:09,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:42:09,374 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 189 transitions. [2024-11-08 18:42:09,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.948717948717949) internal successors, (154), 39 states have internal predecessors, (154), 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-08 18:42:09,374 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 189 transitions. [2024-11-08 18:42:09,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 18:42:09,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:42:09,376 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 18:42:09,397 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 18:42:09,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-08 18:42:09,577 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:42:09,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:42:09,577 INFO L85 PathProgramCache]: Analyzing trace with hash -800338608, now seen corresponding path program 1 times [2024-11-08 18:42:09,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:42:09,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538633168] [2024-11-08 18:42:09,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:42:09,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:42:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:42:11,190 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:42:11,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:42:11,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538633168] [2024-11-08 18:42:11,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538633168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:42:11,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639788453] [2024-11-08 18:42:11,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:42:11,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:42:11,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:42:11,194 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:42:11,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 18:42:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:42:11,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 152 conjuncts are in the unsatisfiable core [2024-11-08 18:42:11,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:42:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:42:12,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:42:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:42:16,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639788453] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:42:16,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:42:16,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 24] total 51 [2024-11-08 18:42:16,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804659127] [2024-11-08 18:42:16,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:42:16,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-08 18:42:16,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:42:16,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-08 18:42:16,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=2279, Unknown=0, NotChecked=0, Total=2550 [2024-11-08 18:42:16,892 INFO L87 Difference]: Start difference. First operand 145 states and 189 transitions. Second operand has 51 states, 51 states have (on average 2.9411764705882355) internal successors, (150), 51 states have internal predecessors, (150), 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-08 18:42:23,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:42:23,735 INFO L93 Difference]: Finished difference Result 417 states and 557 transitions. [2024-11-08 18:42:23,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-08 18:42:23,736 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.9411764705882355) internal successors, (150), 51 states have internal predecessors, (150), 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 58 [2024-11-08 18:42:23,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:42:23,737 INFO L225 Difference]: With dead ends: 417 [2024-11-08 18:42:23,737 INFO L226 Difference]: Without dead ends: 300 [2024-11-08 18:42:23,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1948 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=724, Invalid=6416, Unknown=0, NotChecked=0, Total=7140 [2024-11-08 18:42:23,740 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 627 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 2146 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:42:23,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 896 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2146 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-08 18:42:23,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-08 18:42:23,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 286. [2024-11-08 18:42:23,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 285 states have (on average 1.3192982456140352) internal successors, (376), 285 states have internal predecessors, (376), 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-08 18:42:23,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 376 transitions. [2024-11-08 18:42:23,751 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 376 transitions. Word has length 58 [2024-11-08 18:42:23,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:42:23,752 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 376 transitions. [2024-11-08 18:42:23,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.9411764705882355) internal successors, (150), 51 states have internal predecessors, (150), 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-08 18:42:23,752 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 376 transitions. [2024-11-08 18:42:23,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-08 18:42:23,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:42:23,753 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-08 18:42:23,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 18:42:23,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-08 18:42:23,957 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:42:23,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:42:23,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2069830699, now seen corresponding path program 1 times [2024-11-08 18:42:23,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:42:23,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827701912] [2024-11-08 18:42:23,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:42:23,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:42:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:42:26,150 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:42:26,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:42:26,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827701912] [2024-11-08 18:42:26,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827701912] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:42:26,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084139841] [2024-11-08 18:42:26,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:42:26,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:42:26,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:42:26,152 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:42:26,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 18:42:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:42:26,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 103 conjuncts are in the unsatisfiable core [2024-11-08 18:42:26,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:42:27,583 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:42:27,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:42:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:42:28,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084139841] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:42:28,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:42:28,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 16] total 42 [2024-11-08 18:42:28,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279559257] [2024-11-08 18:42:28,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:42:28,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-08 18:42:28,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:42:28,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-08 18:42:28,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1492, Unknown=0, NotChecked=0, Total=1722 [2024-11-08 18:42:28,657 INFO L87 Difference]: Start difference. First operand 286 states and 376 transitions. Second operand has 42 states, 42 states have (on average 3.8095238095238093) internal successors, (160), 42 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-08 18:42:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:42:32,801 INFO L93 Difference]: Finished difference Result 760 states and 1034 transitions. [2024-11-08 18:42:32,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-11-08 18:42:32,802 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.8095238095238093) internal successors, (160), 42 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 59 [2024-11-08 18:42:32,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:42:32,803 INFO L225 Difference]: With dead ends: 760 [2024-11-08 18:42:32,804 INFO L226 Difference]: Without dead ends: 518 [2024-11-08 18:42:32,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3732 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1709, Invalid=12097, Unknown=0, NotChecked=0, Total=13806 [2024-11-08 18:42:32,806 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 649 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:42:32,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 374 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 18:42:32,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-11-08 18:42:32,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 300. [2024-11-08 18:42:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.31438127090301) internal successors, (393), 299 states have internal predecessors, (393), 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-08 18:42:32,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 393 transitions. [2024-11-08 18:42:32,820 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 393 transitions. Word has length 59 [2024-11-08 18:42:32,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:42:32,820 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 393 transitions. [2024-11-08 18:42:32,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.8095238095238093) internal successors, (160), 42 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-08 18:42:32,821 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 393 transitions. [2024-11-08 18:42:32,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-08 18:42:32,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:42:32,822 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 18:42:32,842 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 18:42:33,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 18:42:33,023 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:42:33,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:42:33,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1103912073, now seen corresponding path program 1 times [2024-11-08 18:42:33,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:42:33,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945681043] [2024-11-08 18:42:33,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:42:33,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:42:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:42:34,764 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:42:34,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:42:34,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945681043] [2024-11-08 18:42:34,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945681043] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:42:34,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310806431] [2024-11-08 18:42:34,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:42:34,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:42:34,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:42:34,766 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:42:34,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 18:42:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:42:35,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-11-08 18:42:35,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:42:35,715 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:42:35,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:42:37,327 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:42:37,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310806431] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:42:37,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:42:37,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 17] total 38 [2024-11-08 18:42:37,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467034238] [2024-11-08 18:42:37,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:42:37,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-08 18:42:37,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:42:37,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-08 18:42:37,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1217, Unknown=0, NotChecked=0, Total=1406 [2024-11-08 18:42:37,330 INFO L87 Difference]: Start difference. First operand 300 states and 393 transitions. Second operand has 38 states, 38 states have (on average 4.2105263157894735) internal successors, (160), 38 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-08 18:42:40,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:42:40,299 INFO L93 Difference]: Finished difference Result 950 states and 1273 transitions. [2024-11-08 18:42:40,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-11-08 18:42:40,300 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 4.2105263157894735) internal successors, (160), 38 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 60 [2024-11-08 18:42:40,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:42:40,303 INFO L225 Difference]: With dead ends: 950 [2024-11-08 18:42:40,303 INFO L226 Difference]: Without dead ends: 682 [2024-11-08 18:42:40,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2356 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1126, Invalid=8380, Unknown=0, NotChecked=0, Total=9506 [2024-11-08 18:42:40,307 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 757 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:42:40,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 416 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 18:42:40,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2024-11-08 18:42:40,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 456. [2024-11-08 18:42:40,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 1.3384615384615384) internal successors, (609), 455 states have internal predecessors, (609), 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-08 18:42:40,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 609 transitions. [2024-11-08 18:42:40,327 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 609 transitions. Word has length 60 [2024-11-08 18:42:40,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:42:40,328 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 609 transitions. [2024-11-08 18:42:40,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.2105263157894735) internal successors, (160), 38 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-08 18:42:40,328 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 609 transitions. [2024-11-08 18:42:40,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-08 18:42:40,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:42:40,329 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 18:42:40,350 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 18:42:40,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-08 18:42:40,530 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:42:40,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:42:40,530 INFO L85 PathProgramCache]: Analyzing trace with hash -70075178, now seen corresponding path program 1 times [2024-11-08 18:42:40,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:42:40,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042219107] [2024-11-08 18:42:40,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:42:40,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:42:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:42:41,955 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:42:41,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:42:41,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042219107] [2024-11-08 18:42:41,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042219107] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:42:41,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202942368] [2024-11-08 18:42:41,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:42:41,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:42:41,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:42:41,958 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:42:41,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 18:42:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:42:42,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-11-08 18:42:42,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:42:43,269 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:42:43,269 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:42:44,706 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:42:44,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202942368] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:42:44,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:42:44,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19, 21] total 48 [2024-11-08 18:42:44,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875088645] [2024-11-08 18:42:44,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:42:44,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-08 18:42:44,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:42:44,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-08 18:42:44,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1907, Unknown=0, NotChecked=0, Total=2256 [2024-11-08 18:42:44,709 INFO L87 Difference]: Start difference. First operand 456 states and 609 transitions. Second operand has 48 states, 48 states have (on average 3.5416666666666665) internal successors, (170), 48 states have internal predecessors, (170), 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-08 18:42:47,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:42:47,014 INFO L93 Difference]: Finished difference Result 1018 states and 1362 transitions. [2024-11-08 18:42:47,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-08 18:42:47,014 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.5416666666666665) internal successors, (170), 48 states have internal predecessors, (170), 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 61 [2024-11-08 18:42:47,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:42:47,016 INFO L225 Difference]: With dead ends: 1018 [2024-11-08 18:42:47,017 INFO L226 Difference]: Without dead ends: 594 [2024-11-08 18:42:47,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1345 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=882, Invalid=4668, Unknown=0, NotChecked=0, Total=5550 [2024-11-08 18:42:47,019 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 594 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:42:47,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 601 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 18:42:47,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2024-11-08 18:42:47,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 578. [2024-11-08 18:42:47,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 577 states have (on average 1.3258232235701906) internal successors, (765), 577 states have internal predecessors, (765), 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-08 18:42:47,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 765 transitions. [2024-11-08 18:42:47,045 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 765 transitions. Word has length 61 [2024-11-08 18:42:47,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:42:47,045 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 765 transitions. [2024-11-08 18:42:47,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.5416666666666665) internal successors, (170), 48 states have internal predecessors, (170), 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-08 18:42:47,046 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 765 transitions. [2024-11-08 18:42:47,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-08 18:42:47,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:42:47,047 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 18:42:47,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 18:42:47,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 18:42:47,247 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:42:47,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:42:47,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1073176083, now seen corresponding path program 1 times [2024-11-08 18:42:47,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:42:47,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354568251] [2024-11-08 18:42:47,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:42:47,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:42:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:42:47,923 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 18:42:47,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:42:47,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354568251] [2024-11-08 18:42:47,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354568251] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:42:47,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825874917] [2024-11-08 18:42:47,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:42:47,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:42:47,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:42:47,928 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:42:47,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 18:42:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:42:48,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-08 18:42:48,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:42:48,832 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:42:48,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:42:49,532 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:42:49,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825874917] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:42:49,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:42:49,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 12] total 30 [2024-11-08 18:42:49,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496857558] [2024-11-08 18:42:49,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:42:49,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-08 18:42:49,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:42:49,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-08 18:42:49,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2024-11-08 18:42:49,535 INFO L87 Difference]: Start difference. First operand 578 states and 765 transitions. Second operand has 30 states, 30 states have (on average 5.333333333333333) internal successors, (160), 30 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-08 18:42:50,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:42:50,349 INFO L93 Difference]: Finished difference Result 1400 states and 1866 transitions. [2024-11-08 18:42:50,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 18:42:50,350 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.333333333333333) internal successors, (160), 30 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 62 [2024-11-08 18:42:50,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:42:50,353 INFO L225 Difference]: With dead ends: 1400 [2024-11-08 18:42:50,353 INFO L226 Difference]: Without dead ends: 854 [2024-11-08 18:42:50,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=368, Invalid=1438, Unknown=0, NotChecked=0, Total=1806 [2024-11-08 18:42:50,355 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 183 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:42:50,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 425 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 18:42:50,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2024-11-08 18:42:50,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 590. [2024-11-08 18:42:50,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 589 states have (on average 1.3191850594227503) internal successors, (777), 589 states have internal predecessors, (777), 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-08 18:42:50,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 777 transitions. [2024-11-08 18:42:50,382 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 777 transitions. Word has length 62 [2024-11-08 18:42:50,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:42:50,383 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 777 transitions. [2024-11-08 18:42:50,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.333333333333333) internal successors, (160), 30 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-08 18:42:50,383 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 777 transitions. [2024-11-08 18:42:50,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-08 18:42:50,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:42:50,384 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 18:42:50,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 18:42:50,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-08 18:42:50,585 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:42:50,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:42:50,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1486443023, now seen corresponding path program 1 times [2024-11-08 18:42:50,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:42:50,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072043561] [2024-11-08 18:42:50,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:42:50,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:42:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:42:51,147 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 18:42:51,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:42:51,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072043561] [2024-11-08 18:42:51,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072043561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:42:51,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:42:51,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:42:51,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668573883] [2024-11-08 18:42:51,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:42:51,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:42:51,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:42:51,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:42:51,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:42:51,149 INFO L87 Difference]: Start difference. First operand 590 states and 777 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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-08 18:42:51,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:42:51,247 INFO L93 Difference]: Finished difference Result 883 states and 1169 transitions. [2024-11-08 18:42:51,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:42:51,248 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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 62 [2024-11-08 18:42:51,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:42:51,249 INFO L225 Difference]: With dead ends: 883 [2024-11-08 18:42:51,249 INFO L226 Difference]: Without dead ends: 325 [2024-11-08 18:42:51,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:42:51,250 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 40 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:42:51,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 178 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:42:51,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-08 18:42:51,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 306. [2024-11-08 18:42:51,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.2950819672131149) internal successors, (395), 305 states have internal predecessors, (395), 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-08 18:42:51,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 395 transitions. [2024-11-08 18:42:51,266 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 395 transitions. Word has length 62 [2024-11-08 18:42:51,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:42:51,267 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 395 transitions. [2024-11-08 18:42:51,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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-08 18:42:51,267 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 395 transitions. [2024-11-08 18:42:51,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 18:42:51,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:42:51,268 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 18:42:51,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 18:42:51,268 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:42:51,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:42:51,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1058340025, now seen corresponding path program 1 times [2024-11-08 18:42:51,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:42:51,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559677191] [2024-11-08 18:42:51,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:42:51,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:42:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:42:51,493 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:42:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:42:51,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:42:51,728 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:42:51,731 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 18:42:51,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 18:42:51,736 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:42:51,780 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:42:51,780 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:42:51,780 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:42:51,797 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:42:51,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:42:51 BoogieIcfgContainer [2024-11-08 18:42:51,802 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:42:51,802 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:42:51,802 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:42:51,802 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:42:51,803 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:41:54" (3/4) ... [2024-11-08 18:42:51,806 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 18:42:51,807 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:42:51,807 INFO L158 Benchmark]: Toolchain (without parser) took 59029.78ms. Allocated memory was 130.0MB in the beginning and 524.3MB in the end (delta: 394.3MB). Free memory was 66.1MB in the beginning and 193.7MB in the end (delta: -127.5MB). Peak memory consumption was 268.1MB. Max. memory is 16.1GB. [2024-11-08 18:42:51,808 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 130.0MB. Free memory is still 102.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:42:51,808 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.31ms. Allocated memory was 130.0MB in the beginning and 167.8MB in the end (delta: 37.7MB). Free memory was 66.0MB in the beginning and 124.4MB in the end (delta: -58.4MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2024-11-08 18:42:51,808 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.54ms. Allocated memory is still 167.8MB. Free memory was 124.4MB in the beginning and 119.6MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:42:51,809 INFO L158 Benchmark]: Boogie Preprocessor took 81.38ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 116.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:42:51,809 INFO L158 Benchmark]: RCFGBuilder took 679.85ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 87.2MB in the end (delta: 28.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-08 18:42:51,810 INFO L158 Benchmark]: TraceAbstraction took 57779.37ms. Allocated memory was 167.8MB in the beginning and 524.3MB in the end (delta: 356.5MB). Free memory was 86.6MB in the beginning and 193.7MB in the end (delta: -107.1MB). Peak memory consumption was 250.0MB. Max. memory is 16.1GB. [2024-11-08 18:42:51,811 INFO L158 Benchmark]: Witness Printer took 4.50ms. Allocated memory is still 524.3MB. Free memory is still 193.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:42:51,812 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.21ms. Allocated memory is still 130.0MB. Free memory is still 102.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.31ms. Allocated memory was 130.0MB in the beginning and 167.8MB in the end (delta: 37.7MB). Free memory was 66.0MB in the beginning and 124.4MB in the end (delta: -58.4MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.54ms. Allocated memory is still 167.8MB. Free memory was 124.4MB in the beginning and 119.6MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.38ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 116.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 679.85ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 87.2MB in the end (delta: 28.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 57779.37ms. Allocated memory was 167.8MB in the beginning and 524.3MB in the end (delta: 356.5MB). Free memory was 86.6MB in the beginning and 193.7MB in the end (delta: -107.1MB). Peak memory consumption was 250.0MB. Max. memory is 16.1GB. * Witness Printer took 4.50ms. Allocated memory is still 524.3MB. Free memory is still 193.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 115. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 4); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (4 - 1); [L32] const SORT_3 var_4 = 0; [L33] const SORT_3 var_7 = 1; [L34] const SORT_1 var_14 = 1; [L35] const SORT_3 var_20 = 15; [L37] SORT_1 input_2; [L39] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, var_14=1, var_20=15, var_4=0, var_7=1] [L39] SORT_3 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, var_14=1, var_20=15, var_4=0, var_7=1] [L40] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L42] SORT_3 init_6_arg_1 = var_4; [L43] state_5 = init_6_arg_1 [L44] SORT_3 init_9_arg_1 = var_7; [L45] state_8 = init_9_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_22_arg_0=0, var_22_arg_1=1, var_24=1, var_25=0, var_7=1] [L79] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] EXPR var_22 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_26=0, var_7=1] [L89] EXPR var_26 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=1, var_14=1, var_20=15, var_31_arg_0=0, var_31_arg_1=1, var_33=0, var_7=1] [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=1, var_14=1, var_20=15, var_33=0, var_7=1] [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] EXPR var_31 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=1, var_14=1, var_20=15, var_33=0, var_7=1] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=2, var_7=1] [L115] EXPR var_34 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_7=1] [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_22_arg_0=0, var_22_arg_1=1, var_24=1, var_25=1, var_7=1] [L79] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_24=1, var_25=1, var_7=1] [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] EXPR var_22 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_24=1, var_25=1, var_7=1] [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_26=1, var_7=1] [L89] EXPR var_26 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_7=1] [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=1, state_5=0, state_8=0, var_14=1, var_20=15, var_31_arg_0=1, var_31_arg_1=1, var_33=0, var_7=1] [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=1, state_5=0, state_8=0, var_14=1, var_20=15, var_33=0, var_7=1] [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] EXPR var_31 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=1, state_5=0, state_8=0, var_14=1, var_20=15, var_33=0, var_7=1] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=1, var_14=1, var_20=15, var_34=1, var_7=1] [L115] EXPR var_34 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=1, var_14=1, var_20=15, var_7=1] [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=1, state_8=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-255, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=1, state_8=0, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=1, state_8=0, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.7s, OverallIterations: 19, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4202 SdHoareTripleChecker+Valid, 8.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4202 mSDsluCounter, 6262 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5390 mSDsCounter, 147 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8793 IncrementalHoareTripleChecker+Invalid, 8940 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 147 mSolverCounterUnsat, 872 mSDtfsCounter, 8793 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1235 GetRequests, 651 SyntacticMatches, 0 SemanticMatches, 584 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11790 ImplicationChecksByTransitivity, 20.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=590occurred in iteration=17, InterpolantAutomatonStates: 372, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 976 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 29.3s InterpolantComputationTime, 1243 NumberOfCodeBlocks, 1243 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1505 ConstructedInterpolants, 0 QuantifiedInterpolants, 19247 SizeOfPredicates, 58 NumberOfNonLiveVariables, 3079 ConjunctsInSsa, 663 ConjunctsInUnsatCore, 32 InterpolantComputations, 12 PerfectInterpolantSequences, 403/674 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 18:42:51,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX --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 64bit --witnessprinter.graph.data.programhash fb8ca5e5ce2ed40fdd0ad3d69b0bd96c83a6daf11d842e9766da8dc50e36012a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:42:54,094 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:42:54,180 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-08 18:42:54,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:42:54,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:42:54,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:42:54,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:42:54,210 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:42:54,210 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:42:54,211 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:42:54,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:42:54,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:42:54,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:42:54,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:42:54,214 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:42:54,214 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:42:54,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:42:54,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:42:54,215 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:42:54,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:42:54,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:42:54,217 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:42:54,217 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:42:54,218 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:42:54,218 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:42:54,218 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:42:54,219 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:42:54,219 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:42:54,220 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:42:54,220 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:42:54,220 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:42:54,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:42:54,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:42:54,222 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:42:54,222 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:42:54,222 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 18:42:54,223 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:42:54,223 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:42:54,223 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:42:54,224 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:42:54,224 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:42:54,226 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fb8ca5e5ce2ed40fdd0ad3d69b0bd96c83a6daf11d842e9766da8dc50e36012a [2024-11-08 18:42:54,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:42:54,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:42:54,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:42:54,647 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:42:54,647 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:42:54,649 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c Unable to find full path for "g++" [2024-11-08 18:42:56,772 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:42:57,033 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:42:57,034 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c [2024-11-08 18:42:57,048 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/data/8eec95ccd/c41cc766a67c490bb7f08df8b8ae5bbe/FLAGa49504710 [2024-11-08 18:42:57,070 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/data/8eec95ccd/c41cc766a67c490bb7f08df8b8ae5bbe [2024-11-08 18:42:57,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:42:57,074 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:42:57,076 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:42:57,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:42:57,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:42:57,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:42:57" (1/1) ... [2024-11-08 18:42:57,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d5871f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:57, skipping insertion in model container [2024-11-08 18:42:57,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:42:57" (1/1) ... [2024-11-08 18:42:57,120 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:42:57,340 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c[1255,1268] [2024-11-08 18:42:57,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:42:57,426 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:42:57,441 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c[1255,1268] [2024-11-08 18:42:57,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:42:57,516 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:42:57,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:57 WrapperNode [2024-11-08 18:42:57,517 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:42:57,518 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:42:57,518 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:42:57,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:42:57,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:57" (1/1) ... [2024-11-08 18:42:57,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:57" (1/1) ... [2024-11-08 18:42:57,573 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 109 [2024-11-08 18:42:57,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:42:57,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:42:57,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:42:57,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:42:57,591 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:57" (1/1) ... [2024-11-08 18:42:57,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:57" (1/1) ... [2024-11-08 18:42:57,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:57" (1/1) ... [2024-11-08 18:42:57,622 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-08 18:42:57,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:57" (1/1) ... [2024-11-08 18:42:57,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:57" (1/1) ... [2024-11-08 18:42:57,635 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:57" (1/1) ... [2024-11-08 18:42:57,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:57" (1/1) ... [2024-11-08 18:42:57,643 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:57" (1/1) ... [2024-11-08 18:42:57,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:57" (1/1) ... [2024-11-08 18:42:57,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:42:57,655 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:42:57,655 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:42:57,656 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:42:57,656 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:57" (1/1) ... [2024-11-08 18:42:57,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:42:57,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:42:57,699 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:42:57,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:42:57,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:42:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:42:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:42:57,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:42:57,840 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:42:57,842 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:42:58,103 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-08 18:42:58,103 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:42:58,114 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:42:58,116 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:42:58,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:42:58 BoogieIcfgContainer [2024-11-08 18:42:58,117 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:42:58,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:42:58,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:42:58,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:42:58,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:42:57" (1/3) ... [2024-11-08 18:42:58,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4cf581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:42:58, skipping insertion in model container [2024-11-08 18:42:58,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:42:57" (2/3) ... [2024-11-08 18:42:58,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4cf581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:42:58, skipping insertion in model container [2024-11-08 18:42:58,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:42:58" (3/3) ... [2024-11-08 18:42:58,127 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cav14_example_v.c [2024-11-08 18:42:58,145 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:42:58,145 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:42:58,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:42:58,218 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;@321c5ecb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:42:58,219 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:42:58,223 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 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-08 18:42:58,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 18:42:58,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:42:58,229 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 18:42:58,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:42:58,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:42:58,235 INFO L85 PathProgramCache]: Analyzing trace with hash 28698761, now seen corresponding path program 1 times [2024-11-08 18:42:58,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:42:58,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1157181465] [2024-11-08 18:42:58,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:42:58,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:42:58,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:42:58,255 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:42:58,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 18:42:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:42:58,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 18:42:58,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:42:58,665 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-08 18:42:58,665 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:42:58,665 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:42:58,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157181465] [2024-11-08 18:42:58,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157181465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:42:58,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:42:58,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:42:58,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637957580] [2024-11-08 18:42:58,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:42:58,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:42:58,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:42:58,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:42:58,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:42:58,705 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-08 18:42:58,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:42:58,758 INFO L93 Difference]: Finished difference Result 19 states and 27 transitions. [2024-11-08 18:42:58,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:42:58,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-11-08 18:42:58,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:42:58,768 INFO L225 Difference]: With dead ends: 19 [2024-11-08 18:42:58,768 INFO L226 Difference]: Without dead ends: 10 [2024-11-08 18:42:58,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:42:58,777 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:42:58,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:42:58,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-08 18:42:58,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-08 18:42:58,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-08 18:42:58,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-08 18:42:58,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-08 18:42:58,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:42:58,811 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-08 18:42:58,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-08 18:42:58,812 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-08 18:42:58,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 18:42:58,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:42:58,824 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-08 18:42:58,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 18:42:59,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:42:59,025 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:42:59,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:42:59,026 INFO L85 PathProgramCache]: Analyzing trace with hash 271073635, now seen corresponding path program 1 times [2024-11-08 18:42:59,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:42:59,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2015144214] [2024-11-08 18:42:59,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:42:59,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:42:59,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:42:59,030 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:42:59,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 18:42:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:42:59,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 18:42:59,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:42:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:42:59,533 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:43:01,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:43:01,508 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:43:01,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015144214] [2024-11-08 18:43:01,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015144214] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:43:01,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:43:01,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-08 18:43:01,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113809689] [2024-11-08 18:43:01,509 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:43:01,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 18:43:01,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:43:01,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 18:43:01,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:43:01,512 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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-08 18:43:01,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:43:01,720 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-11-08 18:43:01,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:43:01,721 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 8 [2024-11-08 18:43:01,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:43:01,722 INFO L225 Difference]: With dead ends: 18 [2024-11-08 18:43:01,723 INFO L226 Difference]: Without dead ends: 16 [2024-11-08 18:43:01,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:43:01,725 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:43:01,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:43:01,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-08 18:43:01,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-08 18:43:01,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-08 18:43:01,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-08 18:43:01,730 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-08 18:43:01,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:43:01,731 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-08 18:43:01,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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-08 18:43:01,731 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-08 18:43:01,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 18:43:01,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:43:01,732 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-08 18:43:01,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 18:43:01,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:43:01,936 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:43:01,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:43:01,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1580781475, now seen corresponding path program 2 times [2024-11-08 18:43:01,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:43:01,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [230935460] [2024-11-08 18:43:01,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:43:01,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:43:01,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:43:01,941 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:43:01,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 18:43:02,067 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 18:43:02,067 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:43:02,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-08 18:43:02,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:43:02,640 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:43:02,640 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:43:11,731 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:43:11,732 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:43:11,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230935460] [2024-11-08 18:43:11,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230935460] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:43:11,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:43:11,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-08 18:43:11,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207168527] [2024-11-08 18:43:11,733 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:43:11,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 18:43:11,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:43:11,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 18:43:11,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-11-08 18:43:11,735 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 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-08 18:43:13,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:43:13,540 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-08 18:43:13,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 18:43:13,541 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 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 14 [2024-11-08 18:43:13,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:43:13,541 INFO L225 Difference]: With dead ends: 30 [2024-11-08 18:43:13,541 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 18:43:13,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=200, Invalid=450, Unknown=0, NotChecked=0, Total=650 [2024-11-08 18:43:13,543 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:43:13,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 28 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 18:43:13,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 18:43:13,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-08 18:43:13,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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-08 18:43:13,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-08 18:43:13,553 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2024-11-08 18:43:13,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:43:13,553 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-11-08 18:43:13,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 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-08 18:43:13,553 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-08 18:43:13,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 18:43:13,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:43:13,554 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2024-11-08 18:43:13,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 18:43:13,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:43:13,755 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:43:13,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:43:13,755 INFO L85 PathProgramCache]: Analyzing trace with hash -752690141, now seen corresponding path program 3 times [2024-11-08 18:43:13,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:43:13,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1619715179] [2024-11-08 18:43:13,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 18:43:13,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:43:13,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:43:13,759 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:43:13,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 18:43:13,952 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-08 18:43:13,952 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:43:13,955 WARN L253 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 107 conjuncts are in the unsatisfiable core [2024-11-08 18:43:13,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:43:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:43:14,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:45:11,951 WARN L286 SmtUtils]: Spent 1.37m on a formula simplification. DAG size of input: 477 DAG size of output: 362 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 18:47:47,249 WARN L286 SmtUtils]: Spent 2.12m on a formula simplification. DAG size of input: 571 DAG size of output: 434 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 18:48:11,551 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:48:11,551 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:48:11,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619715179] [2024-11-08 18:48:11,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619715179] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:48:11,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:48:11,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 36 [2024-11-08 18:48:11,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875816792] [2024-11-08 18:48:11,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:48:11,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-08 18:48:11,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:48:11,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-08 18:48:11,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=929, Unknown=0, NotChecked=0, Total=1260 [2024-11-08 18:48:11,555 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 36 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 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-08 18:48:21,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:48:22,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:48:24,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:48:27,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:48:34,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:48:38,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:48:42,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:48:46,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:48:51,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:48:57,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:49:01,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:49:05,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:49:09,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:49:13,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:49:18,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:49:22,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:49:26,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:49:29,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:49:32,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:49:32,290 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2024-11-08 18:49:32,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-08 18:49:32,291 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 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 26 [2024-11-08 18:49:32,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:49:32,292 INFO L225 Difference]: With dead ends: 54 [2024-11-08 18:49:32,292 INFO L226 Difference]: Without dead ends: 52 [2024-11-08 18:49:32,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 240.5s TimeCoverageRelationStatistics Valid=846, Invalid=2016, Unknown=0, NotChecked=0, Total=2862 [2024-11-08 18:49:32,294 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 58 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 42 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 60.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:49:32,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 51 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 356 Invalid, 10 Unknown, 0 Unchecked, 60.0s Time] [2024-11-08 18:49:32,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-08 18:49:32,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2024-11-08 18:49:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 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-08 18:49:32,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2024-11-08 18:49:32,315 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 26 [2024-11-08 18:49:32,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:49:32,315 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2024-11-08 18:49:32,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 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-08 18:49:32,316 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2024-11-08 18:49:32,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 18:49:32,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:49:32,318 INFO L215 NwaCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1] [2024-11-08 18:49:32,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 18:49:32,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:49:32,519 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:49:32,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:49:32,520 INFO L85 PathProgramCache]: Analyzing trace with hash -779438813, now seen corresponding path program 4 times [2024-11-08 18:49:32,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:49:32,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1712006974] [2024-11-08 18:49:32,521 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 18:49:32,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:49:32,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:49:32,523 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:49:32,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 18:49:33,733 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 18:49:33,733 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-08 18:49:33,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:49:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:49:34,141 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-08 18:49:34,141 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:49:34,142 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 18:49:34,171 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 18:49:34,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:49:34,348 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1] [2024-11-08 18:49:34,394 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,394 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,395 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,395 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,395 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,395 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,395 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,396 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,396 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,396 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,396 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,396 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,396 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,397 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,397 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,397 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,430 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:49:34,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:49:34 BoogieIcfgContainer [2024-11-08 18:49:34,433 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:49:34,434 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:49:34,434 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:49:34,435 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:49:34,435 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:42:58" (3/4) ... [2024-11-08 18:49:34,436 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 18:49:34,458 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,458 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,458 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,458 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,458 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,458 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,459 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,459 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,459 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,459 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,459 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,459 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,459 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,459 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,460 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,460 WARN L290 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2024-11-08 18:49:34,598 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/witness.graphml [2024-11-08 18:49:34,598 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:49:34,599 INFO L158 Benchmark]: Toolchain (without parser) took 397525.45ms. Allocated memory was 75.5MB in the beginning and 708.8MB in the end (delta: 633.3MB). Free memory was 51.5MB in the beginning and 469.7MB in the end (delta: -418.2MB). Peak memory consumption was 217.1MB. Max. memory is 16.1GB. [2024-11-08 18:49:34,600 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 62.9MB. Free memory was 39.6MB in the beginning and 39.6MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:49:34,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.21ms. Allocated memory is still 75.5MB. Free memory was 51.3MB in the beginning and 53.8MB in the end (delta: -2.5MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2024-11-08 18:49:34,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.08ms. Allocated memory is still 75.5MB. Free memory was 53.8MB in the beginning and 51.8MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:49:34,601 INFO L158 Benchmark]: Boogie Preprocessor took 76.79ms. Allocated memory is still 75.5MB. Free memory was 51.8MB in the beginning and 49.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:49:34,601 INFO L158 Benchmark]: RCFGBuilder took 461.56ms. Allocated memory is still 75.5MB. Free memory was 49.4MB in the beginning and 52.8MB in the end (delta: -3.5MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2024-11-08 18:49:34,601 INFO L158 Benchmark]: TraceAbstraction took 396314.83ms. Allocated memory was 75.5MB in the beginning and 708.8MB in the end (delta: 633.3MB). Free memory was 52.2MB in the beginning and 488.6MB in the end (delta: -436.4MB). Peak memory consumption was 197.6MB. Max. memory is 16.1GB. [2024-11-08 18:49:34,602 INFO L158 Benchmark]: Witness Printer took 164.56ms. Allocated memory is still 708.8MB. Free memory was 488.6MB in the beginning and 469.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 18:49:34,603 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.25ms. Allocated memory is still 62.9MB. Free memory was 39.6MB in the beginning and 39.6MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.21ms. Allocated memory is still 75.5MB. Free memory was 51.3MB in the beginning and 53.8MB in the end (delta: -2.5MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.08ms. Allocated memory is still 75.5MB. Free memory was 53.8MB in the beginning and 51.8MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.79ms. Allocated memory is still 75.5MB. Free memory was 51.8MB in the beginning and 49.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 461.56ms. Allocated memory is still 75.5MB. Free memory was 49.4MB in the beginning and 52.8MB in the end (delta: -3.5MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * TraceAbstraction took 396314.83ms. Allocated memory was 75.5MB in the beginning and 708.8MB in the end (delta: 633.3MB). Free memory was 52.2MB in the beginning and 488.6MB in the end (delta: -436.4MB). Peak memory consumption was 197.6MB. Max. memory is 16.1GB. * Witness Printer took 164.56ms. Allocated memory is still 708.8MB. Free memory was 488.6MB in the beginning and 469.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. 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: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 4); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (4 - 1); [L32] const SORT_3 var_4 = 0; [L33] const SORT_3 var_7 = 1; [L34] const SORT_1 var_14 = 1; [L35] const SORT_3 var_20 = 15; [L37] SORT_1 input_2; [L39] SORT_3 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L40] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L42] SORT_3 init_6_arg_1 = var_4; [L43] state_5 = init_6_arg_1 [L44] SORT_3 init_9_arg_1 = var_7; [L45] state_8 = init_9_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 396.2s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 82.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 83 SdHoareTripleChecker+Valid, 60.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 60.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 494 IncrementalHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 16 mSDtfsCounter, 494 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 243.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=4, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 309.9s InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 94 ConstructedInterpolants, 36 QuantifiedInterpolants, 62211 SizeOfPredicates, 22 NumberOfNonLiveVariables, 332 ConjunctsInSsa, 193 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/188 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-08 18:49:34,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c170fcf-3c3a-40eb-a746-a830c461486f/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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