./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 0e0057cc
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_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9fafab56630000a79d8eb06cf156a630d9ee1a5dd58dfc1d8991b95956e4dffd
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2023-11-26 10:46:08,016 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-26 10:46:08,157 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf
[2023-11-26 10:46:08,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-26 10:46:08,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-26 10:46:08,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-26 10:46:08,216 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-26 10:46:08,217 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-26 10:46:08,218 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2023-11-26 10:46:08,223 INFO L153 SettingsManager]: * Use memory slicer=true
[2023-11-26 10:46:08,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-26 10:46:08,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-26 10:46:08,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-26 10:46:08,226 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-26 10:46:08,226 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-26 10:46:08,227 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-26 10:46:08,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2023-11-26 10:46:08,228 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-26 10:46:08,228 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-11-26 10:46:08,229 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-26 10:46:08,229 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-26 10:46:08,230 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2023-11-26 10:46:08,230 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-26 10:46:08,231 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2023-11-26 10:46:08,231 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-26 10:46:08,232 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2023-11-26 10:46:08,232 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-26 10:46:08,233 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-26 10:46:08,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-26 10:46:08,234 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2023-11-26 10:46:08,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-26 10:46:08,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2023-11-26 10:46:08,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-26 10:46:08,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-26 10:46:08,237 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-26 10:46:08,237 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-11-26 10:46:08,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-26 10:46:08,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2023-11-26 10:46:08,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-26 10:46:08,238 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-26 10:46:08,238 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-26 10:46:08,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-26 10:46:08,239 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_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/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_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9fafab56630000a79d8eb06cf156a630d9ee1a5dd58dfc1d8991b95956e4dffd
[2023-11-26 10:46:08,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-26 10:46:08,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-26 10:46:08,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-26 10:46:08,583 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-26 10:46:08,584 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-26 10:46:08,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i
[2023-11-26 10:46:11,650 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-26 10:46:11,937 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-26 10:46:11,938 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i
[2023-11-26 10:46:11,949 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/data/a3664c27a/ff215ebdc50b4e12b43cab66517fa76f/FLAGc00b99076
[2023-11-26 10:46:11,972 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/data/a3664c27a/ff215ebdc50b4e12b43cab66517fa76f
[2023-11-26 10:46:11,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-26 10:46:11,981 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-26 10:46:11,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-26 10:46:11,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-26 10:46:11,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-26 10:46:11,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:46:11" (1/1) ...
[2023-11-26 10:46:11,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3108ba1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:11, skipping insertion in model container
[2023-11-26 10:46:11,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:46:11" (1/1) ...
[2023-11-26 10:46:12,047 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-26 10:46:12,204 WARN L240 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_6cfba1a2-d618-4de6-a0b4-b4854c112490/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i[913,926]
[2023-11-26 10:46:12,255 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-26 10:46:12,268 INFO L202 MainTranslator]: Completed pre-run
[2023-11-26 10:46:12,283 WARN L240 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_6cfba1a2-d618-4de6-a0b4-b4854c112490/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i[913,926]
[2023-11-26 10:46:12,310 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-26 10:46:12,329 INFO L206 MainTranslator]: Completed translation
[2023-11-26 10:46:12,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:12 WrapperNode
[2023-11-26 10:46:12,330 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-26 10:46:12,331 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-26 10:46:12,331 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-26 10:46:12,331 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-26 10:46:12,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:12" (1/1) ...
[2023-11-26 10:46:12,350 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:12" (1/1) ...
[2023-11-26 10:46:12,394 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130
[2023-11-26 10:46:12,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-26 10:46:12,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-26 10:46:12,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-26 10:46:12,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-26 10:46:12,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:12" (1/1) ...
[2023-11-26 10:46:12,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:12" (1/1) ...
[2023-11-26 10:46:12,414 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:12" (1/1) ...
[2023-11-26 10:46:12,475 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].
[2023-11-26 10:46:12,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:12" (1/1) ...
[2023-11-26 10:46:12,481 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:12" (1/1) ...
[2023-11-26 10:46:12,495 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:12" (1/1) ...
[2023-11-26 10:46:12,499 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:12" (1/1) ...
[2023-11-26 10:46:12,501 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:12" (1/1) ...
[2023-11-26 10:46:12,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:12" (1/1) ...
[2023-11-26 10:46:12,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-26 10:46:12,525 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-26 10:46:12,525 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-26 10:46:12,525 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-26 10:46:12,526 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:12" (1/1) ...
[2023-11-26 10:46:12,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2023-11-26 10:46:12,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/z3
[2023-11-26 10:46:12,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2023-11-26 10:46:12,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2023-11-26 10:46:12,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-26 10:46:12,623 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2023-11-26 10:46:12,623 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2023-11-26 10:46:12,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2023-11-26 10:46:12,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-26 10:46:12,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-26 10:46:12,751 INFO L241 CfgBuilder]: Building ICFG
[2023-11-26 10:46:12,754 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-26 10:46:13,148 INFO L282 CfgBuilder]: Performing block encoding
[2023-11-26 10:46:13,184 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-26 10:46:13,184 INFO L309 CfgBuilder]: Removed 1 assume(true) statements.
[2023-11-26 10:46:13,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:46:13 BoogieIcfgContainer
[2023-11-26 10:46:13,185 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-26 10:46:13,188 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-26 10:46:13,188 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-26 10:46:13,191 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-26 10:46:13,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:46:11" (1/3) ...
[2023-11-26 10:46:13,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7a57fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:46:13, skipping insertion in model container
[2023-11-26 10:46:13,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:12" (2/3) ...
[2023-11-26 10:46:13,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7a57fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:46:13, skipping insertion in model container
[2023-11-26 10:46:13,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:46:13" (3/3) ...
[2023-11-26 10:46:13,195 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-70.i
[2023-11-26 10:46:13,215 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-26 10:46:13,215 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-11-26 10:46:13,266 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-26 10:46:13,274 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@5afea001, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-11-26 10:46:13,274 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2023-11-26 10:46:13,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 35 states have (on average 1.457142857142857) internal successors, (51), 36 states have internal predecessors, (51), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2023-11-26 10:46:13,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2023-11-26 10:46:13,293 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-26 10:46:13,294 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 10:46:13,295 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-26 10:46:13,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 10:46:13,302 INFO L85 PathProgramCache]: Analyzing trace with hash 406866168, now seen corresponding path program 1 times
[2023-11-26 10:46:13,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 10:46:13,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597318725]
[2023-11-26 10:46:13,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 10:46:13,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 10:46:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:13,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-26 10:46:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:13,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2023-11-26 10:46:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:13,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2023-11-26 10:46:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:13,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2023-11-26 10:46:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:13,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2023-11-26 10:46:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:13,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2023-11-26 10:46:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:13,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36
[2023-11-26 10:46:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:13,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2023-11-26 10:46:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:13,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2023-11-26 10:46:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:13,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53
[2023-11-26 10:46:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:13,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2023-11-26 10:46:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:13,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64
[2023-11-26 10:46:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2023-11-26 10:46:13,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 10:46:13,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597318725]
[2023-11-26 10:46:13,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597318725] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 10:46:13,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 10:46:13,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-26 10:46:13,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384888034]
[2023-11-26 10:46:13,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 10:46:13,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-26 10:46:13,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 10:46:13,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-26 10:46:13,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-26 10:46:13,822 INFO L87 Difference]: Start difference. First operand has 50 states, 35 states have (on average 1.457142857142857) internal successors, (51), 36 states have internal predecessors, (51), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12)
[2023-11-26 10:46:13,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-26 10:46:13,898 INFO L93 Difference]: Finished difference Result 97 states and 160 transitions.
[2023-11-26 10:46:13,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-11-26 10:46:13,901 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83
[2023-11-26 10:46:13,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-26 10:46:13,910 INFO L225 Difference]: With dead ends: 97
[2023-11-26 10:46:13,910 INFO L226 Difference]: Without dead ends: 48
[2023-11-26 10:46:13,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-26 10:46:13,918 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-26 10:46:13,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-26 10:46:13,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2023-11-26 10:46:13,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48.
[2023-11-26 10:46:13,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2023-11-26 10:46:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions.
[2023-11-26 10:46:13,970 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 83
[2023-11-26 10:46:13,971 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-26 10:46:13,971 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions.
[2023-11-26 10:46:13,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12)
[2023-11-26 10:46:13,972 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions.
[2023-11-26 10:46:13,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2023-11-26 10:46:13,977 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-26 10:46:13,977 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 10:46:13,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-26 10:46:13,978 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-26 10:46:13,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 10:46:13,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1600030208, now seen corresponding path program 1 times
[2023-11-26 10:46:13,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 10:46:13,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775125677]
[2023-11-26 10:46:13,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 10:46:13,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 10:46:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:14,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-26 10:46:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:14,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2023-11-26 10:46:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:14,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2023-11-26 10:46:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:14,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2023-11-26 10:46:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:14,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2023-11-26 10:46:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:14,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2023-11-26 10:46:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:14,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36
[2023-11-26 10:46:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:14,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2023-11-26 10:46:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:14,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2023-11-26 10:46:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:14,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53
[2023-11-26 10:46:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:14,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2023-11-26 10:46:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:14,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64
[2023-11-26 10:46:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:14,343 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2023-11-26 10:46:14,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 10:46:14,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775125677]
[2023-11-26 10:46:14,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775125677] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 10:46:14,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 10:46:14,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-26 10:46:14,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463075317]
[2023-11-26 10:46:14,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 10:46:14,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 10:46:14,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 10:46:14,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 10:46:14,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 10:46:14,349 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-26 10:46:14,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-26 10:46:14,414 INFO L93 Difference]: Finished difference Result 95 states and 139 transitions.
[2023-11-26 10:46:14,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-26 10:46:14,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83
[2023-11-26 10:46:14,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-26 10:46:14,418 INFO L225 Difference]: With dead ends: 95
[2023-11-26 10:46:14,418 INFO L226 Difference]: Without dead ends: 48
[2023-11-26 10:46:14,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 10:46:14,421 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 4 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-26 10:46:14,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 105 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-26 10:46:14,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2023-11-26 10:46:14,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48.
[2023-11-26 10:46:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2023-11-26 10:46:14,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions.
[2023-11-26 10:46:14,433 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 83
[2023-11-26 10:46:14,435 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-26 10:46:14,436 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions.
[2023-11-26 10:46:14,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-26 10:46:14,436 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions.
[2023-11-26 10:46:14,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2023-11-26 10:46:14,439 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-26 10:46:14,439 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 10:46:14,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-26 10:46:14,440 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-26 10:46:14,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 10:46:14,440 INFO L85 PathProgramCache]: Analyzing trace with hash -2145450332, now seen corresponding path program 1 times
[2023-11-26 10:46:14,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 10:46:14,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348482149]
[2023-11-26 10:46:14,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 10:46:14,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 10:46:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:14,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-26 10:46:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:14,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2023-11-26 10:46:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:14,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2023-11-26 10:46:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:14,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2023-11-26 10:46:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:14,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2023-11-26 10:46:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:14,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2023-11-26 10:46:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:14,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36
[2023-11-26 10:46:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:14,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2023-11-26 10:46:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:14,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2023-11-26 10:46:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:14,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53
[2023-11-26 10:46:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:14,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2023-11-26 10:46:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:14,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64
[2023-11-26 10:46:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:14,603 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2023-11-26 10:46:14,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 10:46:14,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348482149]
[2023-11-26 10:46:14,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348482149] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 10:46:14,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 10:46:14,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-26 10:46:14,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090229027]
[2023-11-26 10:46:14,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 10:46:14,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 10:46:14,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 10:46:14,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 10:46:14,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 10:46:14,620 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-26 10:46:14,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-26 10:46:14,761 INFO L93 Difference]: Finished difference Result 138 states and 198 transitions.
[2023-11-26 10:46:14,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-26 10:46:14,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85
[2023-11-26 10:46:14,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-26 10:46:14,771 INFO L225 Difference]: With dead ends: 138
[2023-11-26 10:46:14,771 INFO L226 Difference]: Without dead ends: 91
[2023-11-26 10:46:14,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 10:46:14,773 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 56 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2023-11-26 10:46:14,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 134 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2023-11-26 10:46:14,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states.
[2023-11-26 10:46:14,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 59.
[2023-11-26 10:46:14,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2023-11-26 10:46:14,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions.
[2023-11-26 10:46:14,801 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 85
[2023-11-26 10:46:14,802 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-26 10:46:14,803 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 84 transitions.
[2023-11-26 10:46:14,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-26 10:46:14,804 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 84 transitions.
[2023-11-26 10:46:14,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2023-11-26 10:46:14,807 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-26 10:46:14,808 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 10:46:14,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-26 10:46:14,808 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-26 10:46:14,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 10:46:14,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1752423322, now seen corresponding path program 1 times
[2023-11-26 10:46:14,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 10:46:14,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472512587]
[2023-11-26 10:46:14,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 10:46:14,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 10:46:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:15,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-26 10:46:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:15,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2023-11-26 10:46:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:15,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2023-11-26 10:46:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:15,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2023-11-26 10:46:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:15,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2023-11-26 10:46:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:15,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2023-11-26 10:46:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:15,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36
[2023-11-26 10:46:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:15,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2023-11-26 10:46:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:15,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2023-11-26 10:46:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:15,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53
[2023-11-26 10:46:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:15,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2023-11-26 10:46:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:15,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64
[2023-11-26 10:46:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:15,994 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2023-11-26 10:46:15,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 10:46:15,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472512587]
[2023-11-26 10:46:15,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472512587] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 10:46:15,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 10:46:15,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2023-11-26 10:46:15,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903681086]
[2023-11-26 10:46:15,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 10:46:15,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-11-26 10:46:16,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 10:46:16,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-11-26 10:46:16,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56
[2023-11-26 10:46:16,004 INFO L87 Difference]: Start difference. First operand 59 states and 84 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-26 10:46:16,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-26 10:46:16,282 INFO L93 Difference]: Finished difference Result 196 states and 273 transitions.
[2023-11-26 10:46:16,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2023-11-26 10:46:16,283 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85
[2023-11-26 10:46:16,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-26 10:46:16,285 INFO L225 Difference]: With dead ends: 196
[2023-11-26 10:46:16,285 INFO L226 Difference]: Without dead ends: 138
[2023-11-26 10:46:16,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90
[2023-11-26 10:46:16,287 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 98 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2023-11-26 10:46:16,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 212 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2023-11-26 10:46:16,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states.
[2023-11-26 10:46:16,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 104.
[2023-11-26 10:46:16,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 88 states have internal predecessors, (118), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14)
[2023-11-26 10:46:16,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions.
[2023-11-26 10:46:16,305 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 85
[2023-11-26 10:46:16,305 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-26 10:46:16,306 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions.
[2023-11-26 10:46:16,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-26 10:46:16,306 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions.
[2023-11-26 10:46:16,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2023-11-26 10:46:16,308 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-26 10:46:16,308 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 10:46:16,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-26 10:46:16,308 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-26 10:46:16,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 10:46:16,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1733197348, now seen corresponding path program 1 times
[2023-11-26 10:46:16,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 10:46:16,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425344067]
[2023-11-26 10:46:16,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 10:46:16,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 10:46:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:18,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-26 10:46:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:18,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2023-11-26 10:46:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:18,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2023-11-26 10:46:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:18,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2023-11-26 10:46:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:18,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2023-11-26 10:46:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:18,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2023-11-26 10:46:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:18,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36
[2023-11-26 10:46:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:18,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2023-11-26 10:46:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:18,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2023-11-26 10:46:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:18,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53
[2023-11-26 10:46:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:18,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2023-11-26 10:46:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:18,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64
[2023-11-26 10:46:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:18,280 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2023-11-26 10:46:18,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 10:46:18,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425344067]
[2023-11-26 10:46:18,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425344067] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 10:46:18,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 10:46:18,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-26 10:46:18,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18644331]
[2023-11-26 10:46:18,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 10:46:18,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-26 10:46:18,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 10:46:18,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-26 10:46:18,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-11-26 10:46:18,286 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-26 10:46:18,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-26 10:46:18,726 INFO L93 Difference]: Finished difference Result 234 states and 326 transitions.
[2023-11-26 10:46:18,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-11-26 10:46:18,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85
[2023-11-26 10:46:18,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-26 10:46:18,732 INFO L225 Difference]: With dead ends: 234
[2023-11-26 10:46:18,732 INFO L226 Difference]: Without dead ends: 131
[2023-11-26 10:46:18,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2023-11-26 10:46:18,739 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 84 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2023-11-26 10:46:18,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 140 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2023-11-26 10:46:18,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states.
[2023-11-26 10:46:18,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 114.
[2023-11-26 10:46:18,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 98 states have internal predecessors, (131), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14)
[2023-11-26 10:46:18,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions.
[2023-11-26 10:46:18,768 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 85
[2023-11-26 10:46:18,769 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-26 10:46:18,769 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions.
[2023-11-26 10:46:18,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-26 10:46:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions.
[2023-11-26 10:46:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2023-11-26 10:46:18,773 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-26 10:46:18,773 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 10:46:18,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-26 10:46:18,773 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-26 10:46:18,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 10:46:18,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1531426724, now seen corresponding path program 1 times
[2023-11-26 10:46:18,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 10:46:18,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422814111]
[2023-11-26 10:46:18,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 10:46:18,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 10:46:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:24,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-26 10:46:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:24,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2023-11-26 10:46:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:24,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2023-11-26 10:46:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:24,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2023-11-26 10:46:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:24,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2023-11-26 10:46:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:24,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2023-11-26 10:46:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:24,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36
[2023-11-26 10:46:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:24,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2023-11-26 10:46:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:24,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2023-11-26 10:46:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:24,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53
[2023-11-26 10:46:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:24,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2023-11-26 10:46:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:24,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64
[2023-11-26 10:46:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:24,543 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2023-11-26 10:46:24,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 10:46:24,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422814111]
[2023-11-26 10:46:24,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422814111] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 10:46:24,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 10:46:24,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2023-11-26 10:46:24,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015953175]
[2023-11-26 10:46:24,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 10:46:24,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-11-26 10:46:24,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 10:46:24,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-11-26 10:46:24,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2023-11-26 10:46:24,546 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-26 10:46:33,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-26 10:46:37,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-26 10:46:38,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-26 10:46:38,419 INFO L93 Difference]: Finished difference Result 259 states and 355 transitions.
[2023-11-26 10:46:38,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2023-11-26 10:46:38,420 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85
[2023-11-26 10:46:38,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-26 10:46:38,423 INFO L225 Difference]: With dead ends: 259
[2023-11-26 10:46:38,423 INFO L226 Difference]: Without dead ends: 146
[2023-11-26 10:46:38,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272
[2023-11-26 10:46:38,425 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 116 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time
[2023-11-26 10:46:38,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 334 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 349 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time]
[2023-11-26 10:46:38,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states.
[2023-11-26 10:46:38,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 114.
[2023-11-26 10:46:38,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 98 states have internal predecessors, (131), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14)
[2023-11-26 10:46:38,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions.
[2023-11-26 10:46:38,441 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 85
[2023-11-26 10:46:38,442 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-26 10:46:38,442 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions.
[2023-11-26 10:46:38,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-26 10:46:38,442 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions.
[2023-11-26 10:46:38,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2023-11-26 10:46:38,443 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-26 10:46:38,444 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 10:46:38,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-26 10:46:38,444 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-26 10:46:38,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 10:46:38,445 INFO L85 PathProgramCache]: Analyzing trace with hash 722080098, now seen corresponding path program 1 times
[2023-11-26 10:46:38,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 10:46:38,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647735666]
[2023-11-26 10:46:38,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 10:46:38,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 10:46:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:39,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-26 10:46:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:39,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2023-11-26 10:46:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:39,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2023-11-26 10:46:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:39,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2023-11-26 10:46:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:39,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2023-11-26 10:46:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:39,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2023-11-26 10:46:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:39,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36
[2023-11-26 10:46:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:39,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2023-11-26 10:46:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:39,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2023-11-26 10:46:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:39,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53
[2023-11-26 10:46:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:39,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2023-11-26 10:46:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:39,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64
[2023-11-26 10:46:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2023-11-26 10:46:39,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 10:46:39,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647735666]
[2023-11-26 10:46:39,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647735666] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 10:46:39,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 10:46:39,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-26 10:46:39,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617399176]
[2023-11-26 10:46:39,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 10:46:39,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-26 10:46:39,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 10:46:39,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-26 10:46:39,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-11-26 10:46:39,746 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-26 10:46:40,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-26 10:46:40,077 INFO L93 Difference]: Finished difference Result 230 states and 319 transitions.
[2023-11-26 10:46:40,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-11-26 10:46:40,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85
[2023-11-26 10:46:40,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-26 10:46:40,080 INFO L225 Difference]: With dead ends: 230
[2023-11-26 10:46:40,081 INFO L226 Difference]: Without dead ends: 117
[2023-11-26 10:46:40,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2023-11-26 10:46:40,082 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 54 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2023-11-26 10:46:40,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 132 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2023-11-26 10:46:40,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2023-11-26 10:46:40,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 104.
[2023-11-26 10:46:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 88 states have internal predecessors, (116), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14)
[2023-11-26 10:46:40,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 144 transitions.
[2023-11-26 10:46:40,105 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 144 transitions. Word has length 85
[2023-11-26 10:46:40,105 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-26 10:46:40,105 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 144 transitions.
[2023-11-26 10:46:40,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-26 10:46:40,105 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 144 transitions.
[2023-11-26 10:46:40,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2023-11-26 10:46:40,106 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-26 10:46:40,107 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 10:46:40,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-26 10:46:40,107 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-26 10:46:40,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 10:46:40,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1262680296, now seen corresponding path program 1 times
[2023-11-26 10:46:40,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 10:46:40,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826878383]
[2023-11-26 10:46:40,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 10:46:40,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 10:46:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-26 10:46:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2023-11-26 10:46:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2023-11-26 10:46:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2023-11-26 10:46:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2023-11-26 10:46:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2023-11-26 10:46:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36
[2023-11-26 10:46:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2023-11-26 10:46:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2023-11-26 10:46:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53
[2023-11-26 10:46:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2023-11-26 10:46:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64
[2023-11-26 10:46:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,192 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2023-11-26 10:46:40,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 10:46:40,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826878383]
[2023-11-26 10:46:40,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826878383] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 10:46:40,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 10:46:40,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-26 10:46:40,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854350525]
[2023-11-26 10:46:40,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 10:46:40,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 10:46:40,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 10:46:40,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 10:46:40,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 10:46:40,195 INFO L87 Difference]: Start difference. First operand 104 states and 144 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-26 10:46:40,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-26 10:46:40,226 INFO L93 Difference]: Finished difference Result 210 states and 289 transitions.
[2023-11-26 10:46:40,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-26 10:46:40,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85
[2023-11-26 10:46:40,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-26 10:46:40,228 INFO L225 Difference]: With dead ends: 210
[2023-11-26 10:46:40,229 INFO L226 Difference]: Without dead ends: 107
[2023-11-26 10:46:40,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 10:46:40,231 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 29 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-26 10:46:40,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 146 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-26 10:46:40,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states.
[2023-11-26 10:46:40,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104.
[2023-11-26 10:46:40,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 88 states have internal predecessors, (115), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14)
[2023-11-26 10:46:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 143 transitions.
[2023-11-26 10:46:40,253 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 143 transitions. Word has length 85
[2023-11-26 10:46:40,254 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-26 10:46:40,254 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 143 transitions.
[2023-11-26 10:46:40,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-26 10:46:40,254 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions.
[2023-11-26 10:46:40,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2023-11-26 10:46:40,255 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-26 10:46:40,256 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 10:46:40,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-26 10:46:40,256 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-26 10:46:40,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 10:46:40,257 INFO L85 PathProgramCache]: Analyzing trace with hash 251563046, now seen corresponding path program 1 times
[2023-11-26 10:46:40,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 10:46:40,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642705291]
[2023-11-26 10:46:40,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 10:46:40,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 10:46:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-26 10:46:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2023-11-26 10:46:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2023-11-26 10:46:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2023-11-26 10:46:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2023-11-26 10:46:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2023-11-26 10:46:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36
[2023-11-26 10:46:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2023-11-26 10:46:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2023-11-26 10:46:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53
[2023-11-26 10:46:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2023-11-26 10:46:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64
[2023-11-26 10:46:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,446 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2023-11-26 10:46:40,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 10:46:40,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642705291]
[2023-11-26 10:46:40,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642705291] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 10:46:40,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 10:46:40,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-26 10:46:40,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826904163]
[2023-11-26 10:46:40,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 10:46:40,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-26 10:46:40,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 10:46:40,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-26 10:46:40,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-26 10:46:40,451 INFO L87 Difference]: Start difference. First operand 104 states and 143 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-26 10:46:40,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-26 10:46:40,497 INFO L93 Difference]: Finished difference Result 210 states and 287 transitions.
[2023-11-26 10:46:40,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-26 10:46:40,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85
[2023-11-26 10:46:40,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-26 10:46:40,499 INFO L225 Difference]: With dead ends: 210
[2023-11-26 10:46:40,500 INFO L226 Difference]: Without dead ends: 107
[2023-11-26 10:46:40,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-11-26 10:46:40,503 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 26 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-26 10:46:40,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 219 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-26 10:46:40,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states.
[2023-11-26 10:46:40,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104.
[2023-11-26 10:46:40,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 88 states have internal predecessors, (113), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14)
[2023-11-26 10:46:40,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 141 transitions.
[2023-11-26 10:46:40,521 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 141 transitions. Word has length 85
[2023-11-26 10:46:40,522 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-26 10:46:40,523 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 141 transitions.
[2023-11-26 10:46:40,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-26 10:46:40,523 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 141 transitions.
[2023-11-26 10:46:40,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2023-11-26 10:46:40,524 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-26 10:46:40,525 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 10:46:40,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-26 10:46:40,525 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-26 10:46:40,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 10:46:40,526 INFO L85 PathProgramCache]: Analyzing trace with hash -745219659, now seen corresponding path program 1 times
[2023-11-26 10:46:40,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 10:46:40,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391884477]
[2023-11-26 10:46:40,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 10:46:40,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 10:46:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-26 10:46:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2023-11-26 10:46:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2023-11-26 10:46:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2023-11-26 10:46:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2023-11-26 10:46:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2023-11-26 10:46:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36
[2023-11-26 10:46:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2023-11-26 10:46:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2023-11-26 10:46:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53
[2023-11-26 10:46:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2023-11-26 10:46:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64
[2023-11-26 10:46:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,624 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2023-11-26 10:46:40,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 10:46:40,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391884477]
[2023-11-26 10:46:40,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391884477] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 10:46:40,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 10:46:40,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-26 10:46:40,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650910477]
[2023-11-26 10:46:40,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 10:46:40,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 10:46:40,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 10:46:40,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 10:46:40,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 10:46:40,627 INFO L87 Difference]: Start difference. First operand 104 states and 141 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-26 10:46:40,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-26 10:46:40,678 INFO L93 Difference]: Finished difference Result 207 states and 281 transitions.
[2023-11-26 10:46:40,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-26 10:46:40,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88
[2023-11-26 10:46:40,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-26 10:46:40,682 INFO L225 Difference]: With dead ends: 207
[2023-11-26 10:46:40,682 INFO L226 Difference]: Without dead ends: 104
[2023-11-26 10:46:40,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 10:46:40,684 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 5 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-26 10:46:40,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 103 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-26 10:46:40,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states.
[2023-11-26 10:46:40,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104.
[2023-11-26 10:46:40,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 88 states have internal predecessors, (109), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14)
[2023-11-26 10:46:40,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 137 transitions.
[2023-11-26 10:46:40,706 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 137 transitions. Word has length 88
[2023-11-26 10:46:40,707 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-26 10:46:40,707 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 137 transitions.
[2023-11-26 10:46:40,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)
[2023-11-26 10:46:40,707 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 137 transitions.
[2023-11-26 10:46:40,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2023-11-26 10:46:40,710 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-26 10:46:40,710 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 10:46:40,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-26 10:46:40,710 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-26 10:46:40,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 10:46:40,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1647609509, now seen corresponding path program 1 times
[2023-11-26 10:46:40,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 10:46:40,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902635420]
[2023-11-26 10:46:40,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 10:46:40,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 10:46:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-26 10:46:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2023-11-26 10:46:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2023-11-26 10:46:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2023-11-26 10:46:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2023-11-26 10:46:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2023-11-26 10:46:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:40,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36
[2023-11-26 10:46:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:41,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2023-11-26 10:46:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:41,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2023-11-26 10:46:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:41,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53
[2023-11-26 10:46:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:41,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2023-11-26 10:46:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:41,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64
[2023-11-26 10:46:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:41,027 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked.
[2023-11-26 10:46:41,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 10:46:41,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902635420]
[2023-11-26 10:46:41,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902635420] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-26 10:46:41,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28665448]
[2023-11-26 10:46:41,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 10:46:41,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-26 10:46:41,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/z3
[2023-11-26 10:46:41,035 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-26 10:46:41,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-11-26 10:46:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:41,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 12 conjunts are in the unsatisfiable core
[2023-11-26 10:46:41,188 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-26 10:46:41,389 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 113 proven. 24 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked.
[2023-11-26 10:46:41,389 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2023-11-26 10:46:42,347 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked.
[2023-11-26 10:46:42,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28665448] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-26 10:46:42,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-26 10:46:42,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9] total 14
[2023-11-26 10:46:42,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392240684]
[2023-11-26 10:46:42,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-26 10:46:42,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2023-11-26 10:46:42,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 10:46:42,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2023-11-26 10:46:42,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182
[2023-11-26 10:46:42,351 INFO L87 Difference]: Start difference. First operand 104 states and 137 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29)
[2023-11-26 10:46:43,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-26 10:46:43,992 INFO L93 Difference]: Finished difference Result 262 states and 328 transitions.
[2023-11-26 10:46:43,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2023-11-26 10:46:43,993 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 90
[2023-11-26 10:46:43,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-26 10:46:43,994 INFO L225 Difference]: With dead ends: 262
[2023-11-26 10:46:43,994 INFO L226 Difference]: Without dead ends: 153
[2023-11-26 10:46:43,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930
[2023-11-26 10:46:43,996 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 143 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2023-11-26 10:46:43,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 239 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2023-11-26 10:46:43,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states.
[2023-11-26 10:46:44,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 100.
[2023-11-26 10:46:44,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 83 states have internal predecessors, (97), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14)
[2023-11-26 10:46:44,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 125 transitions.
[2023-11-26 10:46:44,014 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 125 transitions. Word has length 90
[2023-11-26 10:46:44,015 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-26 10:46:44,015 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 125 transitions.
[2023-11-26 10:46:44,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29)
[2023-11-26 10:46:44,015 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions.
[2023-11-26 10:46:44,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2023-11-26 10:46:44,017 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-26 10:46:44,017 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 10:46:44,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-11-26 10:46:44,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-26 10:46:44,224 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-26 10:46:44,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 10:46:44,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1545220059, now seen corresponding path program 1 times
[2023-11-26 10:46:44,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 10:46:44,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474088020]
[2023-11-26 10:46:44,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 10:46:44,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 10:46:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:44,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2023-11-26 10:46:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:44,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2023-11-26 10:46:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:44,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2023-11-26 10:46:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:44,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2023-11-26 10:46:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:44,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2023-11-26 10:46:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:44,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2023-11-26 10:46:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:44,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36
[2023-11-26 10:46:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:44,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2023-11-26 10:46:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:44,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2023-11-26 10:46:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:44,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53
[2023-11-26 10:46:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:44,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2023-11-26 10:46:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:44,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64
[2023-11-26 10:46:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:44,892 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked.
[2023-11-26 10:46:44,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 10:46:44,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474088020]
[2023-11-26 10:46:44,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474088020] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-26 10:46:44,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190878547]
[2023-11-26 10:46:44,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 10:46:44,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-26 10:46:44,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/z3
[2023-11-26 10:46:44,894 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-26 10:46:44,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-11-26 10:46:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:45,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 15 conjunts are in the unsatisfiable core
[2023-11-26 10:46:45,017 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-26 10:46:45,288 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked.
[2023-11-26 10:46:45,288 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2023-11-26 10:46:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked.
[2023-11-26 10:46:45,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190878547] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-26 10:46:45,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-26 10:46:45,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22
[2023-11-26 10:46:45,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86214922]
[2023-11-26 10:46:45,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-26 10:46:45,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2023-11-26 10:46:45,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 10:46:45,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2023-11-26 10:46:45,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462
[2023-11-26 10:46:45,575 INFO L87 Difference]: Start difference. First operand 100 states and 125 transitions. Second operand has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31)
[2023-11-26 10:46:46,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-26 10:46:46,770 INFO L93 Difference]: Finished difference Result 211 states and 259 transitions.
[2023-11-26 10:46:46,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2023-11-26 10:46:46,771 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 90
[2023-11-26 10:46:46,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-26 10:46:46,772 INFO L225 Difference]: With dead ends: 211
[2023-11-26 10:46:46,772 INFO L226 Difference]: Without dead ends: 112
[2023-11-26 10:46:46,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=302, Invalid=1180, Unknown=0, NotChecked=0, Total=1482
[2023-11-26 10:46:46,775 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 302 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2023-11-26 10:46:46,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 243 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2023-11-26 10:46:46,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states.
[2023-11-26 10:46:46,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104.
[2023-11-26 10:46:46,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.1529411764705881) internal successors, (98), 86 states have internal predecessors, (98), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14)
[2023-11-26 10:46:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions.
[2023-11-26 10:46:46,794 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 90
[2023-11-26 10:46:46,794 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-26 10:46:46,794 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions.
[2023-11-26 10:46:46,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31)
[2023-11-26 10:46:46,795 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions.
[2023-11-26 10:46:46,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2023-11-26 10:46:46,796 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-26 10:46:46,796 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 10:46:46,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2023-11-26 10:46:47,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-26 10:46:47,003 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-26 10:46:47,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 10:46:47,004 INFO L85 PathProgramCache]: Analyzing trace with hash 958414045, now seen corresponding path program 1 times
[2023-11-26 10:46:47,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 10:46:47,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659734485]
[2023-11-26 10:46:47,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 10:46:47,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 10:46:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-26 10:46:47,040 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-26 10:46:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-26 10:46:47,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-26 10:46:47,135 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-11-26 10:46:47,136 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2023-11-26 10:46:47,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-26 10:46:47,141 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 10:46:47,145 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2023-11-26 10:46:47,220 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated
[2023-11-26 10:46:47,230 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated
[2023-11-26 10:46:47,230 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated
[2023-11-26 10:46:47,230 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated
[2023-11-26 10:46:47,232 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite6 could not be translated
[2023-11-26 10:46:47,232 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated
[2023-11-26 10:46:47,233 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated
[2023-11-26 10:46:47,233 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated
[2023-11-26 10:46:47,234 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated
[2023-11-26 10:46:47,234 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated
[2023-11-26 10:46:47,234 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated
[2023-11-26 10:46:47,235 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated
[2023-11-26 10:46:47,235 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated
[2023-11-26 10:46:47,235 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated
[2023-11-26 10:46:47,235 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated
[2023-11-26 10:46:47,235 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated
[2023-11-26 10:46:47,238 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated
[2023-11-26 10:46:47,239 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated
[2023-11-26 10:46:47,239 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated
[2023-11-26 10:46:47,240 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated
[2023-11-26 10:46:47,241 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated
[2023-11-26 10:46:47,241 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated
[2023-11-26 10:46:47,241 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated
[2023-11-26 10:46:47,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 10:46:47 BoogieIcfgContainer
[2023-11-26 10:46:47,262 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-26 10:46:47,263 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-26 10:46:47,263 INFO L270 PluginConnector]: Initializing Witness Printer...
[2023-11-26 10:46:47,263 INFO L274 PluginConnector]: Witness Printer initialized
[2023-11-26 10:46:47,264 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:46:13" (3/4) ...
[2023-11-26 10:46:47,266 INFO L140 WitnessPrinter]: No result that supports witness generation found
[2023-11-26 10:46:47,267 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-26 10:46:47,267 INFO L158 Benchmark]: Toolchain (without parser) took 35286.43ms. Allocated memory was 125.8MB in the beginning and 281.0MB in the end (delta: 155.2MB). Free memory was 73.1MB in the beginning and 235.2MB in the end (delta: -162.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2023-11-26 10:46:47,268 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 125.8MB. Free memory was 80.6MB in the beginning and 80.4MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB.
[2023-11-26 10:46:47,268 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.34ms. Allocated memory is still 125.8MB. Free memory was 72.9MB in the beginning and 60.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2023-11-26 10:46:47,269 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.43ms. Allocated memory is still 125.8MB. Free memory was 60.3MB in the beginning and 57.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2023-11-26 10:46:47,270 INFO L158 Benchmark]: Boogie Preprocessor took 128.14ms. Allocated memory is still 125.8MB. Free memory was 57.3MB in the beginning and 95.5MB in the end (delta: -38.3MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB.
[2023-11-26 10:46:47,270 INFO L158 Benchmark]: RCFGBuilder took 660.46ms. Allocated memory is still 125.8MB. Free memory was 95.5MB in the beginning and 79.6MB in the end (delta: 15.9MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB.
[2023-11-26 10:46:47,271 INFO L158 Benchmark]: TraceAbstraction took 34074.70ms. Allocated memory was 125.8MB in the beginning and 281.0MB in the end (delta: 155.2MB). Free memory was 78.4MB in the beginning and 236.2MB in the end (delta: -157.8MB). There was no memory consumed. Max. memory is 16.1GB.
[2023-11-26 10:46:47,271 INFO L158 Benchmark]: Witness Printer took 4.24ms. Allocated memory is still 281.0MB. Free memory was 236.2MB in the beginning and 235.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2023-11-26 10:46:47,273 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.30ms. Allocated memory is still 125.8MB. Free memory was 80.6MB in the beginning and 80.4MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 345.34ms. Allocated memory is still 125.8MB. Free memory was 72.9MB in the beginning and 60.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 64.43ms. Allocated memory is still 125.8MB. Free memory was 60.3MB in the beginning and 57.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 128.14ms. Allocated memory is still 125.8MB. Free memory was 57.3MB in the beginning and 95.5MB in the end (delta: -38.3MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB.
* RCFGBuilder took 660.46ms. Allocated memory is still 125.8MB. Free memory was 95.5MB in the beginning and 79.6MB in the end (delta: 15.9MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB.
* TraceAbstraction took 34074.70ms. Allocated memory was 125.8MB in the beginning and 281.0MB in the end (delta: 155.2MB). Free memory was 78.4MB in the beginning and 236.2MB in the end (delta: -157.8MB). There was no memory consumed. Max. memory is 16.1GB.
* Witness Printer took 4.24ms. Allocated memory is still 281.0MB. Free memory was 236.2MB in the beginning and 235.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~ite6 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated
- GenericResult: Unfinished Backtranslation
The program execution was not completely translated back.
* 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: 19]: 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 someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryArithmeticDOUBLEoperation at line 57.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] unsigned short int var_1_1 = 0;
[L23] unsigned char var_1_2 = 0;
[L24] unsigned short int var_1_4 = 19138;
[L25] signed char var_1_6 = 25;
[L26] signed long int var_1_7 = -50;
[L27] double var_1_8 = 8.3;
[L28] double var_1_9 = 255.6;
[L29] double var_1_10 = 10000000.375;
[L30] double var_1_11 = 0.0;
[L31] double var_1_12 = 255.375;
[L32] unsigned char var_1_13 = 50;
[L33] unsigned char var_1_14 = 2;
[L34] signed char var_1_15 = 1;
[L35] signed char var_1_16 = 5;
[L89] isInitial = 1
[L90] FCALL initially()
[L91] COND TRUE 1
[L92] FCALL updateLastVariables()
[L93] CALL updateVariables()
[L61] var_1_2 = __VERIFIER_nondet_uchar()
[L62] CALL assume_abort_if_not(var_1_2 >= 0)
VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5]
[L62] RET assume_abort_if_not(var_1_2 >= 0)
VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5]
[L63] CALL assume_abort_if_not(var_1_2 <= 1)
VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5]
[L63] RET assume_abort_if_not(var_1_2 <= 1)
VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5]
[L64] var_1_4 = __VERIFIER_nondet_ushort()
[L65] CALL assume_abort_if_not(var_1_4 >= 16383)
VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5]
[L65] RET assume_abort_if_not(var_1_4 >= 16383)
VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5]
[L66] CALL assume_abort_if_not(var_1_4 <= 32767)
VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5]
[L66] RET assume_abort_if_not(var_1_4 <= 32767)
VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5]
[L67] var_1_9 = __VERIFIER_nondet_double()
[L68] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L68] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ))
VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L69] var_1_10 = __VERIFIER_nondet_double()
[L70] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L70] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ))
VAL [isInitial=1, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L71] var_1_11 = __VERIFIER_nondet_double()
[L72] CALL assume_abort_if_not((var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1, isInitial=1, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L72] RET assume_abort_if_not((var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ))
VAL [isInitial=1, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L73] var_1_12 = __VERIFIER_nondet_double()
[L74] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L74] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F ))
VAL [isInitial=1, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L75] var_1_14 = __VERIFIER_nondet_uchar()
[L76] CALL assume_abort_if_not(var_1_14 >= 0)
VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L76] RET assume_abort_if_not(var_1_14 >= 0)
VAL [isInitial=1, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L77] CALL assume_abort_if_not(var_1_14 <= 254)
VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L77] RET assume_abort_if_not(var_1_14 <= 254)
VAL [isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L78] var_1_16 = __VERIFIER_nondet_char()
[L79] CALL assume_abort_if_not(var_1_16 >= -127)
VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L79] RET assume_abort_if_not(var_1_16 >= -127)
VAL [isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L80] CALL assume_abort_if_not(var_1_16 <= 126)
VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L80] RET assume_abort_if_not(var_1_16 <= 126)
VAL [isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L93] RET updateVariables()
[L94] CALL step()
[L39] var_1_13 = var_1_14
[L40] var_1_15 = var_1_16
VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L41] COND TRUE \read(var_1_2)
[L42] var_1_1 = ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13))
VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L44] COND FALSE !(var_1_2 && (var_1_4 >= (var_1_13 + var_1_1)))
VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L47] unsigned short int stepLocal_0 = var_1_4;
VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L48] EXPR var_1_13 << var_1_13
VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L48] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))
VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L48] EXPR var_1_13 << var_1_13
VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L48] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))
VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10]
[L48] COND FALSE !(stepLocal_0 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)))))
[L51] var_1_7 = (var_1_13 + (var_1_1 + var_1_4))
VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988, var_1_8=83/10]
[L53] unsigned char stepLocal_1 = var_1_13;
VAL [isInitial=1, stepLocal_0=16383, stepLocal_1=0, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988, var_1_8=83/10]
[L54] COND FALSE !(var_1_13 < stepLocal_1)
[L57] var_1_8 = ((var_1_11 - var_1_12) - var_1_9)
VAL [isInitial=1, stepLocal_0=16383, stepLocal_1=0, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988]
[L94] RET step()
[L95] CALL, EXPR property()
[L85] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4)))))
VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988]
[L85] EXPR var_1_13 << var_1_13
VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988]
[L85] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))
VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988]
[L85] EXPR var_1_13 << var_1_13
VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988]
[L85] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))
VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988]
[L85] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4)))))
VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988]
[L85-L86] return (((((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4)))))) && ((var_1_13 < var_1_13) ? (var_1_8 == ((double) (var_1_9 - var_1_10))) : (var_1_8 == ((double) ((var_1_11 - var_1_12) - var_1_9))))) && (var_1_13 == ((unsigned char) var_1_14))) && (var_1_15 == ((signed char) var_1_16))
;
[L95] RET, EXPR property()
[L95] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [\old(cond)=0, cond=0, isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988]
[L19] reach_error()
VAL [\old(cond)=0, cond=0, isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.9s, OverallIterations: 13, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 921 SdHoareTripleChecker+Valid, 11.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 917 mSDsluCounter, 2074 SdHoareTripleChecker+Invalid, 11.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1343 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1953 IncrementalHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 731 mSDtfsCounter, 1953 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 772 GetRequests, 665 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=5, InterpolantAutomatonStates: 97, 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, 12 MinimizatonAttempts, 195 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.7s InterpolantComputationTime, 1299 NumberOfCodeBlocks, 1299 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1373 ConstructedInterpolants, 0 QuantifiedInterpolants, 8428 SizeOfPredicates, 9 NumberOfNonLiveVariables, 447 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 4071/4224 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
[2023-11-26 10:46:47,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/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_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9fafab56630000a79d8eb06cf156a630d9ee1a5dd58dfc1d8991b95956e4dffd
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2023-11-26 10:46:49,983 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-26 10:46:50,130 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2023-11-26 10:46:50,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-26 10:46:50,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-26 10:46:50,186 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-26 10:46:50,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-26 10:46:50,187 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-26 10:46:50,188 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2023-11-26 10:46:50,193 INFO L153 SettingsManager]: * Use memory slicer=true
[2023-11-26 10:46:50,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-26 10:46:50,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-26 10:46:50,195 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-26 10:46:50,197 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-26 10:46:50,197 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-26 10:46:50,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-26 10:46:50,199 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2023-11-26 10:46:50,199 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-26 10:46:50,199 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-26 10:46:50,200 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-26 10:46:50,200 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2023-11-26 10:46:50,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-26 10:46:50,201 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2023-11-26 10:46:50,202 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2023-11-26 10:46:50,202 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2023-11-26 10:46:50,203 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2023-11-26 10:46:50,203 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-26 10:46:50,204 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2023-11-26 10:46:50,204 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-26 10:46:50,204 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-26 10:46:50,206 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-26 10:46:50,206 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2023-11-26 10:46:50,207 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-26 10:46:50,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2023-11-26 10:46:50,207 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-26 10:46:50,207 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-26 10:46:50,208 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-26 10:46:50,209 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2023-11-26 10:46:50,209 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2023-11-26 10:46:50,209 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2023-11-26 10:46:50,209 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-26 10:46:50,210 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-26 10:46:50,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-26 10:46:50,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-26 10:46:50,211 INFO L153 SettingsManager]: * Logic for external solver=AUFBV
[2023-11-26 10:46:50,211 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_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/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_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9fafab56630000a79d8eb06cf156a630d9ee1a5dd58dfc1d8991b95956e4dffd
[2023-11-26 10:46:50,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-26 10:46:50,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-26 10:46:50,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-26 10:46:50,695 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-26 10:46:50,696 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-26 10:46:50,697 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i
[2023-11-26 10:46:53,806 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-26 10:46:54,193 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-26 10:46:54,194 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i
[2023-11-26 10:46:54,205 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/data/230736fe3/f06a3905eb634e7ab94785968a0d92fb/FLAGd37bb79c4
[2023-11-26 10:46:54,218 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/data/230736fe3/f06a3905eb634e7ab94785968a0d92fb
[2023-11-26 10:46:54,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-26 10:46:54,223 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-26 10:46:54,224 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-26 10:46:54,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-26 10:46:54,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-26 10:46:54,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:46:54" (1/1) ...
[2023-11-26 10:46:54,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64995376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:54, skipping insertion in model container
[2023-11-26 10:46:54,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:46:54" (1/1) ...
[2023-11-26 10:46:54,278 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-26 10:46:54,432 WARN L240 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_6cfba1a2-d618-4de6-a0b4-b4854c112490/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i[913,926]
[2023-11-26 10:46:54,515 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-26 10:46:54,543 INFO L202 MainTranslator]: Completed pre-run
[2023-11-26 10:46:54,563 WARN L240 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_6cfba1a2-d618-4de6-a0b4-b4854c112490/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i[913,926]
[2023-11-26 10:46:54,613 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-26 10:46:54,636 INFO L206 MainTranslator]: Completed translation
[2023-11-26 10:46:54,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:54 WrapperNode
[2023-11-26 10:46:54,638 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-26 10:46:54,639 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-26 10:46:54,640 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-26 10:46:54,641 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-26 10:46:54,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:54" (1/1) ...
[2023-11-26 10:46:54,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:54" (1/1) ...
[2023-11-26 10:46:54,716 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98
[2023-11-26 10:46:54,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-26 10:46:54,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-26 10:46:54,719 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-26 10:46:54,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-26 10:46:54,748 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:54" (1/1) ...
[2023-11-26 10:46:54,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:54" (1/1) ...
[2023-11-26 10:46:54,756 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:54" (1/1) ...
[2023-11-26 10:46:54,786 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].
[2023-11-26 10:46:54,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:54" (1/1) ...
[2023-11-26 10:46:54,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:54" (1/1) ...
[2023-11-26 10:46:54,803 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:54" (1/1) ...
[2023-11-26 10:46:54,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:54" (1/1) ...
[2023-11-26 10:46:54,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:54" (1/1) ...
[2023-11-26 10:46:54,824 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:54" (1/1) ...
[2023-11-26 10:46:54,828 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-26 10:46:54,833 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-26 10:46:54,833 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-26 10:46:54,834 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-26 10:46:54,835 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:54" (1/1) ...
[2023-11-26 10:46:54,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2023-11-26 10:46:54,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/z3
[2023-11-26 10:46:54,867 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2023-11-26 10:46:54,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2023-11-26 10:46:54,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-26 10:46:54,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2023-11-26 10:46:54,918 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2023-11-26 10:46:54,918 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2023-11-26 10:46:54,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-26 10:46:54,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-26 10:46:55,056 INFO L241 CfgBuilder]: Building ICFG
[2023-11-26 10:46:55,061 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-26 10:46:56,515 INFO L282 CfgBuilder]: Performing block encoding
[2023-11-26 10:46:56,569 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-26 10:46:56,570 INFO L309 CfgBuilder]: Removed 1 assume(true) statements.
[2023-11-26 10:46:56,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:46:56 BoogieIcfgContainer
[2023-11-26 10:46:56,571 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-26 10:46:56,574 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-26 10:46:56,574 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-26 10:46:56,578 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-26 10:46:56,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:46:54" (1/3) ...
[2023-11-26 10:46:56,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fff36f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:46:56, skipping insertion in model container
[2023-11-26 10:46:56,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:54" (2/3) ...
[2023-11-26 10:46:56,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fff36f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:46:56, skipping insertion in model container
[2023-11-26 10:46:56,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:46:56" (3/3) ...
[2023-11-26 10:46:56,581 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-70.i
[2023-11-26 10:46:56,602 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-26 10:46:56,602 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-11-26 10:46:56,666 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-26 10:46:56,676 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@3b268032, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-11-26 10:46:56,677 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2023-11-26 10:46:56,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2023-11-26 10:46:56,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2023-11-26 10:46:56,693 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-26 10:46:56,693 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 10:46:56,694 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-26 10:46:56,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 10:46:56,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1254920039, now seen corresponding path program 1 times
[2023-11-26 10:46:56,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-26 10:46:56,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383539337]
[2023-11-26 10:46:56,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 10:46:56,716 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-11-26 10:46:56,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/mathsat
[2023-11-26 10:46:56,719 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-11-26 10:46:56,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2023-11-26 10:46:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:57,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 1 conjunts are in the unsatisfiable core
[2023-11-26 10:46:57,232 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-26 10:46:57,272 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked.
[2023-11-26 10:46:57,273 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-26 10:46:57,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-26 10:46:57,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383539337]
[2023-11-26 10:46:57,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [383539337] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 10:46:57,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 10:46:57,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-26 10:46:57,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097180435]
[2023-11-26 10:46:57,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 10:46:57,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-26 10:46:57,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-26 10:46:57,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-26 10:46:57,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-26 10:46:57,316 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12)
[2023-11-26 10:46:58,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-26 10:46:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-26 10:46:58,576 INFO L93 Difference]: Finished difference Result 75 states and 124 transitions.
[2023-11-26 10:46:58,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-11-26 10:46:58,595 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79
[2023-11-26 10:46:58,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-26 10:46:58,604 INFO L225 Difference]: With dead ends: 75
[2023-11-26 10:46:58,604 INFO L226 Difference]: Without dead ends: 37
[2023-11-26 10:46:58,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-26 10:46:58,614 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2023-11-26 10:46:58,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2023-11-26 10:46:58,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states.
[2023-11-26 10:46:58,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37.
[2023-11-26 10:46:58,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2023-11-26 10:46:58,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions.
[2023-11-26 10:46:58,686 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 52 transitions. Word has length 79
[2023-11-26 10:46:58,687 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-26 10:46:58,687 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 52 transitions.
[2023-11-26 10:46:58,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12)
[2023-11-26 10:46:58,689 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions.
[2023-11-26 10:46:58,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2023-11-26 10:46:58,699 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-26 10:46:58,699 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 10:46:58,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0
[2023-11-26 10:46:58,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-11-26 10:46:58,917 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-26 10:46:58,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 10:46:58,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1235641761, now seen corresponding path program 1 times
[2023-11-26 10:46:58,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-26 10:46:58,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721595585]
[2023-11-26 10:46:58,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 10:46:58,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-11-26 10:46:58,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/mathsat
[2023-11-26 10:46:58,921 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-11-26 10:46:58,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6cfba1a2-d618-4de6-a0b4-b4854c112490/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2023-11-26 10:46:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 10:46:59,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core
[2023-11-26 10:46:59,315 INFO L285 TraceCheckSpWp]: Computing forward predicates...