./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-9.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version a0165632
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-9.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7e6c0b98ea15a7bbb7152705c795840c7a867a48d25afd45c72ea1c159b166d
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 18:03:57,793 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 18:03:57,867 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-08 18:03:57,872 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 18:03:57,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 18:03:57,895 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 18:03:57,896 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 18:03:57,897 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 18:03:57,897 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 18:03:57,898 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 18:03:57,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 18:03:57,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 18:03:57,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 18:03:57,900 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 18:03:57,900 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 18:03:57,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 18:03:57,901 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 18:03:57,901 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 18:03:57,902 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 18:03:57,902 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 18:03:57,903 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 18:03:57,906 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 18:03:57,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 18:03:57,907 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 18:03:57,907 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 18:03:57,908 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 18:03:57,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 18:03:57,908 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 18:03:57,909 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 18:03:57,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 18:03:57,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 18:03:57,910 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 18:03:57,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:03:57,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 18:03:57,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 18:03:57,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 18:03:57,916 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-08 18:03:57,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 18:03:57,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 18:03:57,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 18:03:57,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 18:03:57,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 18:03:57,919 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_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d7e6c0b98ea15a7bbb7152705c795840c7a867a48d25afd45c72ea1c159b166d
[2024-11-08 18:03:58,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 18:03:58,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 18:03:58,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 18:03:58,232 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 18:03:58,232 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 18:03:58,233 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-9.i
Unable to find full path for "g++"
[2024-11-08 18:04:00,224 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 18:04:00,508 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 18:04:00,509 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-9.i
[2024-11-08 18:04:00,522 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/data/bc0e9d249/7e704493d1734457b0c7237e3df9dfeb/FLAGd185854fa
[2024-11-08 18:04:00,540 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/data/bc0e9d249/7e704493d1734457b0c7237e3df9dfeb
[2024-11-08 18:04:00,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 18:04:00,545 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 18:04:00,546 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 18:04:00,546 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 18:04:00,553 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 18:04:00,554 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:04:00" (1/1) ...
[2024-11-08 18:04:00,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22bba57d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:00, skipping insertion in model container
[2024-11-08 18:04:00,555 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:04:00" (1/1) ...
[2024-11-08 18:04:00,594 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 18:04:00,811 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-9.i[912,925]
[2024-11-08 18:04:00,889 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:04:00,908 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 18:04:00,924 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-9.i[912,925]
[2024-11-08 18:04:00,956 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:04:00,982 INFO L204 MainTranslator]: Completed translation
[2024-11-08 18:04:00,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:00 WrapperNode
[2024-11-08 18:04:00,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 18:04:00,985 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 18:04:00,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 18:04:00,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 18:04:00,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:00" (1/1) ...
[2024-11-08 18:04:01,013 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:00" (1/1) ...
[2024-11-08 18:04:01,096 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175
[2024-11-08 18:04:01,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 18:04:01,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 18:04:01,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 18:04:01,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 18:04:01,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:00" (1/1) ...
[2024-11-08 18:04:01,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:00" (1/1) ...
[2024-11-08 18:04:01,153 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:00" (1/1) ...
[2024-11-08 18:04:01,179 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-08 18:04:01,183 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:00" (1/1) ...
[2024-11-08 18:04:01,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:00" (1/1) ...
[2024-11-08 18:04:01,200 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:00" (1/1) ...
[2024-11-08 18:04:01,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:00" (1/1) ...
[2024-11-08 18:04:01,219 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:00" (1/1) ...
[2024-11-08 18:04:01,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:00" (1/1) ...
[2024-11-08 18:04:01,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 18:04:01,233 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 18:04:01,234 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 18:04:01,234 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 18:04:01,235 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:00" (1/1) ...
[2024-11-08 18:04:01,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:04:01,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:04:01,286 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 18:04:01,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 18:04:01,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 18:04:01,329 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-08 18:04:01,329 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-08 18:04:01,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 18:04:01,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 18:04:01,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 18:04:01,455 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 18:04:01,457 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 18:04:02,039 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live.
[2024-11-08 18:04:02,040 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 18:04:02,059 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 18:04:02,059 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 18:04:02,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:04:02 BoogieIcfgContainer
[2024-11-08 18:04:02,060 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 18:04:02,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 18:04:02,063 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 18:04:02,066 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 18:04:02,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:04:00" (1/3) ...
[2024-11-08 18:04:02,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d187d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:04:02, skipping insertion in model container
[2024-11-08 18:04:02,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:00" (2/3) ...
[2024-11-08 18:04:02,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d187d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:04:02, skipping insertion in model container
[2024-11-08 18:04:02,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:04:02" (3/3) ...
[2024-11-08 18:04:02,070 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-9.i
[2024-11-08 18:04:02,089 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 18:04:02,089 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 18:04:02,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 18:04:02,155 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2f4d90cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 18:04:02,155 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 18:04:02,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2024-11-08 18:04:02,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2024-11-08 18:04:02,174 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:04:02,175 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:02,176 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:04:02,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:04:02,181 INFO L85 PathProgramCache]: Analyzing trace with hash 337415320, now seen corresponding path program 1 times
[2024-11-08 18:04:02,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:04:02,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670858375]
[2024-11-08 18:04:02,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:02,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:04:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:02,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:04:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:02,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:04:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:02,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 18:04:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:02,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:04:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:02,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:04:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:02,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:04:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:02,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:04:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:02,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:04:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:02,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:04:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:02,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:04:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:02,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 18:04:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:02,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 18:04:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:02,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 18:04:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:02,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 18:04:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:02,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 18:04:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:02,592 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-08 18:04:02,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:04:02,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670858375]
[2024-11-08 18:04:02,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670858375] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:04:02,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:04:02,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 18:04:02,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698964998]
[2024-11-08 18:04:02,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:04:02,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 18:04:02,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:04:02,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 18:04:02,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 18:04:02,632 INFO L87 Difference]: Start difference. First operand has 74 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15)
[2024-11-08 18:04:02,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:04:02,662 INFO L93 Difference]: Finished difference Result 141 states and 227 transitions.
[2024-11-08 18:04:02,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 18:04:02,664 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 108
[2024-11-08 18:04:02,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:04:02,675 INFO L225 Difference]: With dead ends: 141
[2024-11-08 18:04:02,675 INFO L226 Difference]: Without dead ends: 70
[2024-11-08 18:04:02,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 18:04:02,688 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 18:04:02,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 18:04:02,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states.
[2024-11-08 18:04:02,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70.
[2024-11-08 18:04:02,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2024-11-08 18:04:02,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions.
[2024-11-08 18:04:02,746 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 102 transitions. Word has length 108
[2024-11-08 18:04:02,746 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:04:02,747 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 102 transitions.
[2024-11-08 18:04:02,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15)
[2024-11-08 18:04:02,747 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 102 transitions.
[2024-11-08 18:04:02,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2024-11-08 18:04:02,753 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:04:02,753 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:02,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 18:04:02,754 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:04:02,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:04:02,756 INFO L85 PathProgramCache]: Analyzing trace with hash -796463022, now seen corresponding path program 1 times
[2024-11-08 18:04:02,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:04:02,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555434955]
[2024-11-08 18:04:02,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:02,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:04:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:03,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:04:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:03,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:04:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:03,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 18:04:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:03,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:04:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:03,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:04:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:03,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:04:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:03,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:04:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:03,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:04:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:03,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:04:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:03,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:04:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:03,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 18:04:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:03,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 18:04:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:03,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 18:04:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:03,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 18:04:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:03,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 18:04:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:03,178 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-08 18:04:03,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:04:03,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555434955]
[2024-11-08 18:04:03,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555434955] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:04:03,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:04:03,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 18:04:03,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974460582]
[2024-11-08 18:04:03,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:04:03,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 18:04:03,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:04:03,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 18:04:03,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 18:04:03,189 INFO L87 Difference]: Start difference. First operand 70 states and 102 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-08 18:04:03,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:04:03,227 INFO L93 Difference]: Finished difference Result 138 states and 203 transitions.
[2024-11-08 18:04:03,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 18:04:03,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108
[2024-11-08 18:04:03,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:04:03,231 INFO L225 Difference]: With dead ends: 138
[2024-11-08 18:04:03,231 INFO L226 Difference]: Without dead ends: 71
[2024-11-08 18:04:03,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 18:04:03,235 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 18:04:03,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 18:04:03,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states.
[2024-11-08 18:04:03,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71.
[2024-11-08 18:04:03,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2024-11-08 18:04:03,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 103 transitions.
[2024-11-08 18:04:03,255 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 103 transitions. Word has length 108
[2024-11-08 18:04:03,256 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:04:03,256 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 103 transitions.
[2024-11-08 18:04:03,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-08 18:04:03,257 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 103 transitions.
[2024-11-08 18:04:03,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2024-11-08 18:04:03,259 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:04:03,259 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:03,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-08 18:04:03,259 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:04:03,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:04:03,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1142314634, now seen corresponding path program 1 times
[2024-11-08 18:04:03,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:04:03,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319639961]
[2024-11-08 18:04:03,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:03,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:04:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:06,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:04:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:06,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:04:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:06,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 18:04:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:06,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:04:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:06,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:04:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:06,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:04:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:06,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:04:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:06,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:04:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:06,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:04:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:06,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:04:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:06,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 18:04:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:06,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 18:04:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:06,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 18:04:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:06,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 18:04:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:06,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 18:04:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-08 18:04:06,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:04:06,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319639961]
[2024-11-08 18:04:06,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319639961] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:04:06,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:04:06,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 18:04:06,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461157271]
[2024-11-08 18:04:06,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:04:06,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-08 18:04:06,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:04:06,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-08 18:04:06,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-11-08 18:04:06,569 INFO L87 Difference]: Start difference. First operand 71 states and 103 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-08 18:04:07,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:04:07,017 INFO L93 Difference]: Finished difference Result 179 states and 260 transitions.
[2024-11-08 18:04:07,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-08 18:04:07,019 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109
[2024-11-08 18:04:07,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:04:07,021 INFO L225 Difference]: With dead ends: 179
[2024-11-08 18:04:07,021 INFO L226 Difference]: Without dead ends: 111
[2024-11-08 18:04:07,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2024-11-08 18:04:07,023 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 167 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-08 18:04:07,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 316 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-08 18:04:07,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states.
[2024-11-08 18:04:07,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95.
[2024-11-08 18:04:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2024-11-08 18:04:07,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 140 transitions.
[2024-11-08 18:04:07,034 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 140 transitions. Word has length 109
[2024-11-08 18:04:07,035 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:04:07,035 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 140 transitions.
[2024-11-08 18:04:07,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-08 18:04:07,036 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 140 transitions.
[2024-11-08 18:04:07,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2024-11-08 18:04:07,038 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:04:07,038 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:07,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-08 18:04:07,038 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:04:07,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:04:07,039 INFO L85 PathProgramCache]: Analyzing trace with hash -546629108, now seen corresponding path program 1 times
[2024-11-08 18:04:07,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:04:07,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280469875]
[2024-11-08 18:04:07,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:07,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:04:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:09,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:04:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:09,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:04:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:09,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 18:04:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:09,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:04:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:09,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:04:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:09,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:04:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:09,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:04:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:09,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:04:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:09,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:04:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:09,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:04:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:09,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 18:04:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:09,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 18:04:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:09,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 18:04:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:09,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 18:04:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:09,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 18:04:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:09,675 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-08 18:04:09,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:04:09,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280469875]
[2024-11-08 18:04:09,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280469875] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:04:09,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:04:09,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 18:04:09,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160204712]
[2024-11-08 18:04:09,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:04:09,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-08 18:04:09,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:04:09,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-08 18:04:09,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-11-08 18:04:09,678 INFO L87 Difference]: Start difference. First operand 95 states and 140 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-08 18:04:10,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:04:10,675 INFO L93 Difference]: Finished difference Result 267 states and 391 transitions.
[2024-11-08 18:04:10,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-08 18:04:10,676 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109
[2024-11-08 18:04:10,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:04:10,678 INFO L225 Difference]: With dead ends: 267
[2024-11-08 18:04:10,678 INFO L226 Difference]: Without dead ends: 175
[2024-11-08 18:04:10,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-11-08 18:04:10,680 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 93 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2024-11-08 18:04:10,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 452 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2024-11-08 18:04:10,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states.
[2024-11-08 18:04:10,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 97.
[2024-11-08 18:04:10,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2024-11-08 18:04:10,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 143 transitions.
[2024-11-08 18:04:10,691 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 143 transitions. Word has length 109
[2024-11-08 18:04:10,692 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:04:10,692 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 143 transitions.
[2024-11-08 18:04:10,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-08 18:04:10,693 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 143 transitions.
[2024-11-08 18:04:10,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2024-11-08 18:04:10,694 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:04:10,695 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:10,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-08 18:04:10,695 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:04:10,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:04:10,696 INFO L85 PathProgramCache]: Analyzing trace with hash -123927282, now seen corresponding path program 1 times
[2024-11-08 18:04:10,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:04:10,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675173739]
[2024-11-08 18:04:10,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:10,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:04:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:12,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:04:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:12,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:04:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:12,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 18:04:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:12,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:04:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:12,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:04:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:12,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:04:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:12,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:04:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:12,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:04:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:12,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:04:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:12,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:04:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:12,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 18:04:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:12,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 18:04:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:12,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 18:04:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:12,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 18:04:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:12,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 18:04:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:12,064 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-08 18:04:12,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:04:12,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675173739]
[2024-11-08 18:04:12,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675173739] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:04:12,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:04:12,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 18:04:12,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886834345]
[2024-11-08 18:04:12,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:04:12,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-08 18:04:12,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:04:12,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-08 18:04:12,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-11-08 18:04:12,072 INFO L87 Difference]: Start difference. First operand 97 states and 143 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-08 18:04:13,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:04:13,326 INFO L93 Difference]: Finished difference Result 233 states and 342 transitions.
[2024-11-08 18:04:13,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-08 18:04:13,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109
[2024-11-08 18:04:13,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:04:13,332 INFO L225 Difference]: With dead ends: 233
[2024-11-08 18:04:13,333 INFO L226 Difference]: Without dead ends: 139
[2024-11-08 18:04:13,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-11-08 18:04:13,335 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 93 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2024-11-08 18:04:13,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 447 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2024-11-08 18:04:13,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states.
[2024-11-08 18:04:13,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 73.
[2024-11-08 18:04:13,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2024-11-08 18:04:13,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 105 transitions.
[2024-11-08 18:04:13,353 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 105 transitions. Word has length 109
[2024-11-08 18:04:13,354 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:04:13,354 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 105 transitions.
[2024-11-08 18:04:13,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-08 18:04:13,354 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 105 transitions.
[2024-11-08 18:04:13,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2024-11-08 18:04:13,360 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:04:13,360 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:13,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-08 18:04:13,361 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:04:13,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:04:13,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1999248645, now seen corresponding path program 1 times
[2024-11-08 18:04:13,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:04:13,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507907773]
[2024-11-08 18:04:13,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:13,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:04:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:13,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:04:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:13,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:04:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:13,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 18:04:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:13,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:04:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:13,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:04:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:13,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:04:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:13,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:04:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:13,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:04:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:13,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:04:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:13,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:04:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:13,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 18:04:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:13,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 18:04:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:13,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 18:04:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:13,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 18:04:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:13,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 18:04:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:13,691 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked.
[2024-11-08 18:04:13,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:04:13,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507907773]
[2024-11-08 18:04:13,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507907773] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 18:04:13,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995407408]
[2024-11-08 18:04:13,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:13,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:04:13,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:04:13,698 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:04:13,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-08 18:04:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:13,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-11-08 18:04:13,843 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:04:14,278 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 174 proven. 42 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked.
[2024-11-08 18:04:14,279 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 18:04:14,548 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked.
[2024-11-08 18:04:14,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995407408] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 18:04:14,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 18:04:14,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11
[2024-11-08 18:04:14,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699961448]
[2024-11-08 18:04:14,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 18:04:14,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-08 18:04:14,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:04:14,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-08 18:04:14,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2024-11-08 18:04:14,552 INFO L87 Difference]: Start difference. First operand 73 states and 105 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44)
[2024-11-08 18:04:14,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:04:14,831 INFO L93 Difference]: Finished difference Result 153 states and 215 transitions.
[2024-11-08 18:04:14,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-11-08 18:04:14,833 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) Word has length 111
[2024-11-08 18:04:14,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:04:14,834 INFO L225 Difference]: With dead ends: 153
[2024-11-08 18:04:14,835 INFO L226 Difference]: Without dead ends: 83
[2024-11-08 18:04:14,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240
[2024-11-08 18:04:14,837 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 54 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-08 18:04:14,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 174 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-08 18:04:14,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2024-11-08 18:04:14,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81.
[2024-11-08 18:04:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 62 states have internal predecessors, (80), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2024-11-08 18:04:14,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 110 transitions.
[2024-11-08 18:04:14,850 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 110 transitions. Word has length 111
[2024-11-08 18:04:14,851 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:04:14,851 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 110 transitions.
[2024-11-08 18:04:14,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44)
[2024-11-08 18:04:14,852 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions.
[2024-11-08 18:04:14,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2024-11-08 18:04:14,854 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:04:14,854 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:14,878 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-08 18:04:15,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:04:15,055 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:04:15,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:04:15,056 INFO L85 PathProgramCache]: Analyzing trace with hash 5103939, now seen corresponding path program 1 times
[2024-11-08 18:04:15,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:04:15,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594882944]
[2024-11-08 18:04:15,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:15,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:04:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-08 18:04:15,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1126698877]
[2024-11-08 18:04:15,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:15,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:04:15,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:04:15,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:04:15,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-08 18:04:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:15,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-08 18:04:15,738 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:04:15,995 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 182 proven. 30 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked.
[2024-11-08 18:04:15,996 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 18:04:16,338 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked.
[2024-11-08 18:04:16,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:04:16,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594882944]
[2024-11-08 18:04:16,339 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-11-08 18:04:16,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126698877]
[2024-11-08 18:04:16,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126698877] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 18:04:16,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-08 18:04:16,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16
[2024-11-08 18:04:16,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83198603]
[2024-11-08 18:04:16,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-08 18:04:16,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2024-11-08 18:04:16,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:04:16,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2024-11-08 18:04:16,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240
[2024-11-08 18:04:16,342 INFO L87 Difference]: Start difference. First operand 81 states and 110 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26)
[2024-11-08 18:04:17,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:04:17,374 INFO L93 Difference]: Finished difference Result 251 states and 330 transitions.
[2024-11-08 18:04:17,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2024-11-08 18:04:17,375 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 111
[2024-11-08 18:04:17,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:04:17,376 INFO L225 Difference]: With dead ends: 251
[2024-11-08 18:04:17,376 INFO L226 Difference]: Without dead ends: 173
[2024-11-08 18:04:17,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650
[2024-11-08 18:04:17,378 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 209 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2024-11-08 18:04:17,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 711 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2024-11-08 18:04:17,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states.
[2024-11-08 18:04:17,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 120.
[2024-11-08 18:04:17,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.32) internal successors, (132), 100 states have internal predecessors, (132), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2024-11-08 18:04:17,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 162 transitions.
[2024-11-08 18:04:17,390 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 162 transitions. Word has length 111
[2024-11-08 18:04:17,390 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:04:17,390 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 162 transitions.
[2024-11-08 18:04:17,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26)
[2024-11-08 18:04:17,391 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 162 transitions.
[2024-11-08 18:04:17,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2024-11-08 18:04:17,392 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:04:17,392 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:17,412 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-08 18:04:17,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:04:17,593 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:04:17,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:04:17,594 INFO L85 PathProgramCache]: Analyzing trace with hash -425874086, now seen corresponding path program 1 times
[2024-11-08 18:04:17,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:04:17,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424778494]
[2024-11-08 18:04:17,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:17,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:04:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:17,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:04:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:17,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:04:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:17,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 18:04:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:17,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:04:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:17,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:04:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:17,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:04:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:17,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:04:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:17,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:04:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:17,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:04:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:17,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:04:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:17,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 18:04:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:17,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 18:04:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:17,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 18:04:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:17,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 18:04:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:17,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 18:04:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:17,716 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-08 18:04:17,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:04:17,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424778494]
[2024-11-08 18:04:17,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424778494] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:04:17,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:04:17,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 18:04:17,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313729181]
[2024-11-08 18:04:17,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:04:17,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 18:04:17,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:04:17,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 18:04:17,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 18:04:17,718 INFO L87 Difference]: Start difference. First operand 120 states and 162 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-08 18:04:17,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:04:17,807 INFO L93 Difference]: Finished difference Result 288 states and 385 transitions.
[2024-11-08 18:04:17,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 18:04:17,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111
[2024-11-08 18:04:17,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:04:17,809 INFO L225 Difference]: With dead ends: 288
[2024-11-08 18:04:17,810 INFO L226 Difference]: Without dead ends: 171
[2024-11-08 18:04:17,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 18:04:17,811 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 82 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-08 18:04:17,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 192 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-08 18:04:17,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states.
[2024-11-08 18:04:17,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 120.
[2024-11-08 18:04:17,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.31) internal successors, (131), 100 states have internal predecessors, (131), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2024-11-08 18:04:17,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 161 transitions.
[2024-11-08 18:04:17,834 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 161 transitions. Word has length 111
[2024-11-08 18:04:17,834 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:04:17,834 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 161 transitions.
[2024-11-08 18:04:17,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-08 18:04:17,835 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 161 transitions.
[2024-11-08 18:04:17,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2024-11-08 18:04:17,837 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:04:17,837 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:17,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-08 18:04:17,839 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:04:17,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:04:17,839 INFO L85 PathProgramCache]: Analyzing trace with hash -124108806, now seen corresponding path program 1 times
[2024-11-08 18:04:17,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:04:17,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271894503]
[2024-11-08 18:04:17,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:17,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:04:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:18,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:04:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:18,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:04:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:18,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 18:04:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:18,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:04:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:18,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:04:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:18,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:04:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:18,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:04:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:18,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:04:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:18,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:04:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:18,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:04:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:18,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 18:04:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:18,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 18:04:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:18,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 18:04:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:18,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 18:04:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:18,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 18:04:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:18,861 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-08 18:04:18,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:04:18,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271894503]
[2024-11-08 18:04:18,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271894503] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:04:18,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:04:18,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 18:04:18,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302279273]
[2024-11-08 18:04:18,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:04:18,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-08 18:04:18,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:04:18,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-08 18:04:18,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-11-08 18:04:18,864 INFO L87 Difference]: Start difference. First operand 120 states and 161 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-08 18:04:19,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:04:19,626 INFO L93 Difference]: Finished difference Result 479 states and 631 transitions.
[2024-11-08 18:04:19,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-08 18:04:19,626 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111
[2024-11-08 18:04:19,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:04:19,629 INFO L225 Difference]: With dead ends: 479
[2024-11-08 18:04:19,630 INFO L226 Difference]: Without dead ends: 362
[2024-11-08 18:04:19,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-11-08 18:04:19,631 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 202 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-08 18:04:19,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 530 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-08 18:04:19,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states.
[2024-11-08 18:04:19,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 239.
[2024-11-08 18:04:19,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 204 states have (on average 1.3235294117647058) internal successors, (270), 205 states have internal predecessors, (270), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26)
[2024-11-08 18:04:19,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 322 transitions.
[2024-11-08 18:04:19,659 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 322 transitions. Word has length 111
[2024-11-08 18:04:19,659 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:04:19,659 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 322 transitions.
[2024-11-08 18:04:19,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-08 18:04:19,660 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 322 transitions.
[2024-11-08 18:04:19,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2024-11-08 18:04:19,661 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:04:19,662 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:19,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-08 18:04:19,662 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:04:19,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:04:19,663 INFO L85 PathProgramCache]: Analyzing trace with hash 298593020, now seen corresponding path program 1 times
[2024-11-08 18:04:19,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:04:19,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370250996]
[2024-11-08 18:04:19,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:19,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:04:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:20,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:04:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:20,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:04:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:20,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 18:04:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:20,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:04:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:20,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:04:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:20,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:04:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:20,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:04:20,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:20,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:04:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:20,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:04:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:20,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:04:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:20,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 18:04:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:20,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 18:04:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:20,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 18:04:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:20,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 18:04:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:20,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 18:04:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:20,204 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-08 18:04:20,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:04:20,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370250996]
[2024-11-08 18:04:20,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370250996] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:04:20,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:04:20,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-08 18:04:20,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973508888]
[2024-11-08 18:04:20,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:04:20,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-08 18:04:20,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:04:20,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-08 18:04:20,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-11-08 18:04:20,208 INFO L87 Difference]: Start difference. First operand 239 states and 322 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-08 18:04:20,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:04:20,848 INFO L93 Difference]: Finished difference Result 695 states and 916 transitions.
[2024-11-08 18:04:20,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-08 18:04:20,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111
[2024-11-08 18:04:20,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:04:20,853 INFO L225 Difference]: With dead ends: 695
[2024-11-08 18:04:20,853 INFO L226 Difference]: Without dead ends: 459
[2024-11-08 18:04:20,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-11-08 18:04:20,854 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 139 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-08 18:04:20,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 481 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-08 18:04:20,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states.
[2024-11-08 18:04:20,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 246.
[2024-11-08 18:04:20,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 211 states have (on average 1.3270142180094786) internal successors, (280), 212 states have internal predecessors, (280), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26)
[2024-11-08 18:04:20,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 332 transitions.
[2024-11-08 18:04:20,884 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 332 transitions. Word has length 111
[2024-11-08 18:04:20,885 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:04:20,885 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 332 transitions.
[2024-11-08 18:04:20,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-08 18:04:20,885 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 332 transitions.
[2024-11-08 18:04:20,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2024-11-08 18:04:20,887 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:04:20,887 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:20,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-08 18:04:20,887 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:04:20,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:04:20,888 INFO L85 PathProgramCache]: Analyzing trace with hash 161442966, now seen corresponding path program 1 times
[2024-11-08 18:04:20,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:04:20,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391600693]
[2024-11-08 18:04:20,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:20,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:04:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:24,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:04:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:24,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:04:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:24,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 18:04:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:24,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:04:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:24,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:04:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:24,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:04:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:24,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:04:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:24,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:04:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:24,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:04:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:24,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:04:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:24,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 18:04:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:24,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 18:04:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:24,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 18:04:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:24,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 18:04:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:24,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 18:04:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:24,676 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-08 18:04:24,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:04:24,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391600693]
[2024-11-08 18:04:24,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391600693] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:04:24,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:04:24,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2024-11-08 18:04:24,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253599397]
[2024-11-08 18:04:24,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:04:24,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2024-11-08 18:04:24,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:04:24,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2024-11-08 18:04:24,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240
[2024-11-08 18:04:24,680 INFO L87 Difference]: Start difference. First operand 246 states and 332 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-08 18:04:30,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:04:30,006 INFO L93 Difference]: Finished difference Result 562 states and 749 transitions.
[2024-11-08 18:04:30,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2024-11-08 18:04:30,010 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112
[2024-11-08 18:04:30,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:04:30,014 INFO L225 Difference]: With dead ends: 562
[2024-11-08 18:04:30,015 INFO L226 Difference]: Without dead ends: 319
[2024-11-08 18:04:30,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702
[2024-11-08 18:04:30,017 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 223 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2024-11-08 18:04:30,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 900 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2024-11-08 18:04:30,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states.
[2024-11-08 18:04:30,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 276.
[2024-11-08 18:04:30,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 241 states have (on average 1.3319502074688796) internal successors, (321), 242 states have internal predecessors, (321), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26)
[2024-11-08 18:04:30,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 373 transitions.
[2024-11-08 18:04:30,048 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 373 transitions. Word has length 112
[2024-11-08 18:04:30,048 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:04:30,048 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 373 transitions.
[2024-11-08 18:04:30,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-08 18:04:30,049 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 373 transitions.
[2024-11-08 18:04:30,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2024-11-08 18:04:30,050 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:04:30,051 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:30,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-08 18:04:30,051 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:04:30,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:04:30,052 INFO L85 PathProgramCache]: Analyzing trace with hash 463208246, now seen corresponding path program 1 times
[2024-11-08 18:04:30,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:04:30,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174454720]
[2024-11-08 18:04:30,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:30,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:04:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:04:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:04:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 18:04:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:04:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:04:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:04:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:04:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:04:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:04:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:04:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 18:04:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 18:04:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 18:04:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 18:04:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 18:04:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:30,521 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-08 18:04:30,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:04:30,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174454720]
[2024-11-08 18:04:30,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174454720] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:04:30,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:04:30,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-08 18:04:30,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264009269]
[2024-11-08 18:04:30,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:04:30,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-08 18:04:30,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:04:30,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-08 18:04:30,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-08 18:04:30,524 INFO L87 Difference]: Start difference. First operand 276 states and 373 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-08 18:04:31,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:04:31,202 INFO L93 Difference]: Finished difference Result 711 states and 944 transitions.
[2024-11-08 18:04:31,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-08 18:04:31,203 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112
[2024-11-08 18:04:31,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:04:31,205 INFO L225 Difference]: With dead ends: 711
[2024-11-08 18:04:31,208 INFO L226 Difference]: Without dead ends: 438
[2024-11-08 18:04:31,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2024-11-08 18:04:31,210 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 77 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-08 18:04:31,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 568 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-08 18:04:31,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states.
[2024-11-08 18:04:31,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 298.
[2024-11-08 18:04:31,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 263 states have (on average 1.326996197718631) internal successors, (349), 264 states have internal predecessors, (349), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26)
[2024-11-08 18:04:31,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 401 transitions.
[2024-11-08 18:04:31,237 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 401 transitions. Word has length 112
[2024-11-08 18:04:31,238 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:04:31,238 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 401 transitions.
[2024-11-08 18:04:31,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-08 18:04:31,239 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 401 transitions.
[2024-11-08 18:04:31,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2024-11-08 18:04:31,241 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:04:31,241 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:31,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-08 18:04:31,241 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:04:31,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:04:31,242 INFO L85 PathProgramCache]: Analyzing trace with hash -986111170, now seen corresponding path program 1 times
[2024-11-08 18:04:31,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:04:31,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101207118]
[2024-11-08 18:04:31,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:31,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:04:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:04:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-08 18:04:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 18:04:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 18:04:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 18:04:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:04:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37
[2024-11-08 18:04:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:04:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48
[2024-11-08 18:04:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-08 18:04:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 18:04:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-08 18:04:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-08 18:04:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-08 18:04:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 18:04:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:31,368 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-08 18:04:31,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:04:31,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101207118]
[2024-11-08 18:04:31,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101207118] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:04:31,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:04:31,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 18:04:31,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034715766]
[2024-11-08 18:04:31,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:04:31,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 18:04:31,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:04:31,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 18:04:31,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 18:04:31,372 INFO L87 Difference]: Start difference. First operand 298 states and 401 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-08 18:04:31,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:04:31,507 INFO L93 Difference]: Finished difference Result 675 states and 910 transitions.
[2024-11-08 18:04:31,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 18:04:31,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112
[2024-11-08 18:04:31,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:04:31,510 INFO L225 Difference]: With dead ends: 675
[2024-11-08 18:04:31,511 INFO L226 Difference]: Without dead ends: 380
[2024-11-08 18:04:31,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 18:04:31,512 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 27 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-08 18:04:31,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 168 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-08 18:04:31,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states.
[2024-11-08 18:04:31,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 304.
[2024-11-08 18:04:31,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 269 states have (on average 1.3234200743494424) internal successors, (356), 270 states have internal predecessors, (356), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26)
[2024-11-08 18:04:31,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 408 transitions.
[2024-11-08 18:04:31,554 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 408 transitions. Word has length 112
[2024-11-08 18:04:31,556 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:04:31,556 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 408 transitions.
[2024-11-08 18:04:31,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-08 18:04:31,557 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 408 transitions.
[2024-11-08 18:04:31,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2024-11-08 18:04:31,559 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:04:31,560 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:31,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-11-08 18:04:31,560 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:04:31,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:04:31,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1396797839, now seen corresponding path program 1 times
[2024-11-08 18:04:31,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:04:31,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581492253]
[2024-11-08 18:04:31,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:31,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:04:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-08 18:04:31,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [660427722]
[2024-11-08 18:04:31,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:31,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:04:31,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:04:31,642 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:04:31,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-08 18:04:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 18:04:32,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 18:04:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 18:04:32,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 18:04:32,623 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-08 18:04:32,624 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-08 18:04:32,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-11-08 18:04:32,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2024-11-08 18:04:32,832 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:33,000 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 18:04:33,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:04:33 BoogieIcfgContainer
[2024-11-08 18:04:33,007 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 18:04:33,007 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 18:04:33,008 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 18:04:33,008 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 18:04:33,008 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:04:02" (3/4) ...
[2024-11-08 18:04:33,011 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-08 18:04:33,013 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 18:04:33,013 INFO L158 Benchmark]: Toolchain (without parser) took 32468.82ms. Allocated memory was 155.2MB in the beginning and 333.4MB in the end (delta: 178.3MB). Free memory was 120.5MB in the beginning and 205.3MB in the end (delta: -84.8MB). Peak memory consumption was 94.9MB. Max. memory is 16.1GB.
[2024-11-08 18:04:33,014 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 97.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 18:04:33,014 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.89ms. Allocated memory is still 155.2MB. Free memory was 120.0MB in the beginning and 105.2MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2024-11-08 18:04:33,014 INFO L158 Benchmark]: Boogie Procedure Inliner took 112.18ms. Allocated memory is still 155.2MB. Free memory was 105.2MB in the beginning and 102.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-08 18:04:33,015 INFO L158 Benchmark]: Boogie Preprocessor took 135.23ms. Allocated memory is still 155.2MB. Free memory was 102.2MB in the beginning and 98.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-08 18:04:33,015 INFO L158 Benchmark]: RCFGBuilder took 826.33ms. Allocated memory is still 155.2MB. Free memory was 98.5MB in the beginning and 77.0MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB.
[2024-11-08 18:04:33,016 INFO L158 Benchmark]: TraceAbstraction took 30944.48ms. Allocated memory was 155.2MB in the beginning and 333.4MB in the end (delta: 178.3MB). Free memory was 76.1MB in the beginning and 206.3MB in the end (delta: -130.2MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB.
[2024-11-08 18:04:33,017 INFO L158 Benchmark]: Witness Printer took 5.31ms. Allocated memory is still 333.4MB. Free memory was 206.3MB in the beginning and 205.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 18:04:33,019 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.19ms. Allocated memory is still 155.2MB. Free memory is still 97.8MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 437.89ms. Allocated memory is still 155.2MB. Free memory was 120.0MB in the beginning and 105.2MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 112.18ms. Allocated memory is still 155.2MB. Free memory was 105.2MB in the beginning and 102.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 135.23ms. Allocated memory is still 155.2MB. Free memory was 102.2MB in the beginning and 98.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* RCFGBuilder took 826.33ms. Allocated memory is still 155.2MB. Free memory was 98.5MB in the beginning and 77.0MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB.
* TraceAbstraction took 30944.48ms. Allocated memory was 155.2MB in the beginning and 333.4MB in the end (delta: 178.3MB). Free memory was 76.1MB in the beginning and 206.3MB in the end (delta: -130.2MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB.
* Witness Printer took 5.31ms. Allocated memory is still 333.4MB. Free memory was 206.3MB in the beginning and 205.3MB 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.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 119, overapproximation of shiftLeft at line 119.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] double var_1_1 = 5.5;
[L23] signed short int var_1_3 = 1;
[L24] signed long int var_1_5 = -64;
[L25] signed char var_1_6 = 10;
[L26] signed char var_1_7 = 5;
[L27] double var_1_8 = 16.25;
[L28] double var_1_9 = 1.8;
[L29] unsigned char var_1_10 = 32;
[L30] unsigned char var_1_11 = 64;
[L31] unsigned short int var_1_12 = 16;
[L32] unsigned long int var_1_13 = 128;
[L33] unsigned char var_1_15 = 1;
[L34] unsigned short int var_1_16 = 256;
[L35] signed char var_1_18 = -2;
[L36] unsigned char last_1_var_1_10 = 32;
[L37] unsigned short int last_1_var_1_12 = 16;
[L38] unsigned long int last_1_var_1_13 = 128;
VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L123] isInitial = 1
[L124] FCALL initially()
[L125] COND TRUE 1
[L126] CALL updateLastVariables()
[L114] last_1_var_1_10 = var_1_10
[L115] last_1_var_1_12 = var_1_12
[L116] last_1_var_1_13 = var_1_13
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L126] RET updateLastVariables()
[L127] CALL updateVariables()
[L89] var_1_3 = __VERIFIER_nondet_short()
[L90] CALL assume_abort_if_not(var_1_3 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L90] RET assume_abort_if_not(var_1_3 >= 0)
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L91] CALL assume_abort_if_not(var_1_3 <= 8)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L91] RET assume_abort_if_not(var_1_3 <= 8)
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L92] var_1_5 = __VERIFIER_nondet_long()
[L93] CALL assume_abort_if_not(var_1_5 >= -2147483648)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L93] RET assume_abort_if_not(var_1_5 >= -2147483648)
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L94] CALL assume_abort_if_not(var_1_5 <= 2147483647)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L94] RET assume_abort_if_not(var_1_5 <= 2147483647)
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L95] CALL assume_abort_if_not(var_1_5 != 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L95] RET assume_abort_if_not(var_1_5 != 0)
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L96] var_1_6 = __VERIFIER_nondet_char()
[L97] CALL assume_abort_if_not(var_1_6 >= 6)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L97] RET assume_abort_if_not(var_1_6 >= 6)
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L98] CALL assume_abort_if_not(var_1_6 <= 12)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L98] RET assume_abort_if_not(var_1_6 <= 12)
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5]
[L99] var_1_7 = __VERIFIER_nondet_char()
[L100] CALL assume_abort_if_not(var_1_7 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5]
[L100] RET assume_abort_if_not(var_1_7 >= 0)
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5]
[L101] CALL assume_abort_if_not(var_1_7 <= 6)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5]
[L101] RET assume_abort_if_not(var_1_7 <= 6)
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5]
[L102] var_1_8 = __VERIFIER_nondet_double()
[L103] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_9=9/5]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_9=9/5]
[L103] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_9=9/5]
[L104] var_1_9 = __VERIFIER_nondet_double()
[L105] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L105] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L106] var_1_11 = __VERIFIER_nondet_uchar()
[L107] CALL assume_abort_if_not(var_1_11 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L107] RET assume_abort_if_not(var_1_11 >= 0)
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L108] CALL assume_abort_if_not(var_1_11 <= 254)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L108] RET assume_abort_if_not(var_1_11 <= 254)
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L109] var_1_15 = __VERIFIER_nondet_uchar()
[L110] CALL assume_abort_if_not(var_1_15 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L110] RET assume_abort_if_not(var_1_15 >= 0)
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L111] CALL assume_abort_if_not(var_1_15 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L111] RET assume_abort_if_not(var_1_15 <= 1)
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L127] RET updateVariables()
[L128] CALL step()
[L42] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10
[L43] var_1_12 = var_1_6
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=6, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L45] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7;
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=1, var_1_12=6, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L46] COND TRUE var_1_6 <= stepLocal_2
[L47] var_1_10 = var_1_11
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L51] EXPR 1 << var_1_10
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L51] COND FALSE !((1 << var_1_10) != (-500 / -100))
[L58] var_1_13 = var_1_6
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L60] var_1_18 = var_1_3
[L61] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)));
[L62] unsigned char stepLocal_3 = var_1_10;
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L63] COND FALSE !((- var_1_9) <= var_1_8)
[L76] var_1_16 = var_1_10
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L78] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5;
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L79] EXPR var_1_16 >> var_1_3
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L79] signed long int stepLocal_0 = var_1_16 >> var_1_3;
[L80] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5))
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L128] RET step()
[L129] CALL, EXPR property()
[L119] EXPR var_1_16 >> var_1_3
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L119] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L119] EXPR 1 << var_1_10
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L119-L120] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3))
;
[L129] RET, EXPR property()
[L129] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
[L19] reach_error()
VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.7s, OverallIterations: 14, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1372 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1366 mSDsluCounter, 5238 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3836 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3291 IncrementalHoareTripleChecker+Invalid, 3335 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 1402 mSDtfsCounter, 3291 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 942 GetRequests, 833 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=13, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 861 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 1880 NumberOfCodeBlocks, 1880 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1751 ConstructedInterpolants, 0 QuantifiedInterpolants, 7086 SizeOfPredicates, 9 NumberOfNonLiveVariables, 548 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 16 InterpolantComputations, 11 PerfectInterpolantSequences, 6534/6720 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-11-08 18:04:33,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
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_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-9.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7e6c0b98ea15a7bbb7152705c795840c7a867a48d25afd45c72ea1c159b166d
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 18:04:35,442 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 18:04:35,526 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-08 18:04:35,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 18:04:35,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 18:04:35,572 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 18:04:35,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 18:04:35,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 18:04:35,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 18:04:35,576 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 18:04:35,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 18:04:35,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 18:04:35,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 18:04:35,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 18:04:35,580 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 18:04:35,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 18:04:35,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 18:04:35,581 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 18:04:35,581 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 18:04:35,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 18:04:35,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 18:04:35,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 18:04:35,587 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 18:04:35,587 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-08 18:04:35,587 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-08 18:04:35,587 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 18:04:35,588 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-08 18:04:35,588 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 18:04:35,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 18:04:35,588 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 18:04:35,589 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 18:04:35,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 18:04:35,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 18:04:35,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 18:04:35,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:04:35,592 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 18:04:35,592 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 18:04:35,592 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 18:04:35,593 INFO L153 SettingsManager]: * Trace refinement strategy=FOX
[2024-11-08 18:04:35,594 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-08 18:04:35,594 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 18:04:35,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 18:04:35,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 18:04:35,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 18:04:35,610 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_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d7e6c0b98ea15a7bbb7152705c795840c7a867a48d25afd45c72ea1c159b166d
[2024-11-08 18:04:36,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 18:04:36,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 18:04:36,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 18:04:36,066 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 18:04:36,066 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 18:04:36,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-9.i
Unable to find full path for "g++"
[2024-11-08 18:04:38,088 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 18:04:38,344 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 18:04:38,344 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-9.i
[2024-11-08 18:04:38,359 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/data/71069c697/e6211bb38c0843fabc527d50b2c0093b/FLAG942730a2e
[2024-11-08 18:04:38,377 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/data/71069c697/e6211bb38c0843fabc527d50b2c0093b
[2024-11-08 18:04:38,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 18:04:38,381 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 18:04:38,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 18:04:38,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 18:04:38,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 18:04:38,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:04:38" (1/1) ...
[2024-11-08 18:04:38,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1be19baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:38, skipping insertion in model container
[2024-11-08 18:04:38,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:04:38" (1/1) ...
[2024-11-08 18:04:38,421 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 18:04:38,611 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-9.i[912,925]
[2024-11-08 18:04:38,687 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:04:38,710 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 18:04:38,726 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-9.i[912,925]
[2024-11-08 18:04:38,783 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:04:38,816 INFO L204 MainTranslator]: Completed translation
[2024-11-08 18:04:38,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:38 WrapperNode
[2024-11-08 18:04:38,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 18:04:38,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 18:04:38,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 18:04:38,818 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 18:04:38,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:38" (1/1) ...
[2024-11-08 18:04:38,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:38" (1/1) ...
[2024-11-08 18:04:38,907 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120
[2024-11-08 18:04:38,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 18:04:38,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 18:04:38,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 18:04:38,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 18:04:38,927 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:38" (1/1) ...
[2024-11-08 18:04:38,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:38" (1/1) ...
[2024-11-08 18:04:38,934 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:38" (1/1) ...
[2024-11-08 18:04:38,968 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-08 18:04:38,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:38" (1/1) ...
[2024-11-08 18:04:38,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:38" (1/1) ...
[2024-11-08 18:04:39,002 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:38" (1/1) ...
[2024-11-08 18:04:39,006 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:38" (1/1) ...
[2024-11-08 18:04:39,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:38" (1/1) ...
[2024-11-08 18:04:39,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:38" (1/1) ...
[2024-11-08 18:04:39,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 18:04:39,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 18:04:39,029 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 18:04:39,029 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 18:04:39,030 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:38" (1/1) ...
[2024-11-08 18:04:39,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:04:39,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:04:39,062 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 18:04:39,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 18:04:39,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 18:04:39,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-08 18:04:39,093 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-08 18:04:39,093 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-08 18:04:39,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 18:04:39,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 18:04:39,185 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 18:04:39,187 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 18:04:39,730 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live.
[2024-11-08 18:04:39,731 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 18:04:39,751 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 18:04:39,753 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 18:04:39,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:04:39 BoogieIcfgContainer
[2024-11-08 18:04:39,754 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 18:04:39,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 18:04:39,759 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 18:04:39,763 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 18:04:39,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:04:38" (1/3) ...
[2024-11-08 18:04:39,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c310ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:04:39, skipping insertion in model container
[2024-11-08 18:04:39,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:04:38" (2/3) ...
[2024-11-08 18:04:39,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c310ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:04:39, skipping insertion in model container
[2024-11-08 18:04:39,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:04:39" (3/3) ...
[2024-11-08 18:04:39,770 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-9.i
[2024-11-08 18:04:39,818 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 18:04:39,818 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 18:04:39,910 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 18:04:39,919 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@434e5ea7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 18:04:39,920 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 18:04:39,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2024-11-08 18:04:39,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101
[2024-11-08 18:04:39,943 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:04:39,944 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:39,945 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:04:39,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:04:39,953 INFO L85 PathProgramCache]: Analyzing trace with hash 2123019748, now seen corresponding path program 1 times
[2024-11-08 18:04:39,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:04:39,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760652060]
[2024-11-08 18:04:39,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:39,976 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
[2024-11-08 18:04:39,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 18:04:39,980 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/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)
[2024-11-08 18:04:39,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/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
[2024-11-08 18:04:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:40,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-08 18:04:40,262 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:04:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-08 18:04:40,310 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:04:40,311 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:04:40,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760652060]
[2024-11-08 18:04:40,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760652060] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:04:40,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:04:40,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 18:04:40,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418616148]
[2024-11-08 18:04:40,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:04:40,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 18:04:40,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:04:40,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 18:04:40,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 18:04:40,356 INFO L87 Difference]: Start difference. First operand has 55 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-08 18:04:40,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:04:40,387 INFO L93 Difference]: Finished difference Result 103 states and 173 transitions.
[2024-11-08 18:04:40,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 18:04:40,389 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100
[2024-11-08 18:04:40,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:04:40,399 INFO L225 Difference]: With dead ends: 103
[2024-11-08 18:04:40,399 INFO L226 Difference]: Without dead ends: 51
[2024-11-08 18:04:40,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 18:04:40,406 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 18:04:40,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 18:04:40,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2024-11-08 18:04:40,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51.
[2024-11-08 18:04:40,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2024-11-08 18:04:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions.
[2024-11-08 18:04:40,460 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 100
[2024-11-08 18:04:40,462 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:04:40,462 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 74 transitions.
[2024-11-08 18:04:40,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-08 18:04:40,463 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 74 transitions.
[2024-11-08 18:04:40,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2024-11-08 18:04:40,470 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:04:40,471 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:04:40,479 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/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)] Ended with exit code 0
[2024-11-08 18:04:40,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/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
[2024-11-08 18:04:40,673 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:04:40,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:04:40,675 INFO L85 PathProgramCache]: Analyzing trace with hash -793279383, now seen corresponding path program 1 times
[2024-11-08 18:04:40,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:04:40,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503874065]
[2024-11-08 18:04:40,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:04:40,679 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
[2024-11-08 18:04:40,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 18:04:40,683 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/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)
[2024-11-08 18:04:40,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32160793-5b52-427b-9b7e-a55f7e77f29e/bin/uautomizer-verify-jihMAELWvX/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
[2024-11-08 18:04:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:04:40,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 29 conjuncts are in the unsatisfiable core
[2024-11-08 18:04:40,976 INFO L278 TraceCheckSpWp]: Computing forward predicates...