./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a 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_ed3ac871-b4b9-40dd-8927-a30b44044414/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed3ac871-b4b9-40dd-8927-a30b44044414/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed3ac871-b4b9-40dd-8927-a30b44044414/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed3ac871-b4b9-40dd-8927-a30b44044414/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed3ac871-b4b9-40dd-8927-a30b44044414/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed3ac871-b4b9-40dd-8927-a30b44044414/bin/uautomizer-verify-4GaUIPS5ZU --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 2e33738ed6ea5e50e5f6c45ef52d667e94a1539d08a631ee5964d7b99a8f5c91 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:19:07,280 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:19:07,341 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed3ac871-b4b9-40dd-8927-a30b44044414/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:19:07,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:19:07,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:19:07,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:19:07,372 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:19:07,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:19:07,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:19:07,374 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:19:07,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:19:07,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:19:07,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:19:07,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:19:07,376 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:19:07,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:19:07,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:19:07,377 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:19:07,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:19:07,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:19:07,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:19:07,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:19:07,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:19:07,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:19:07,379 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:19:07,380 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:19:07,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:19:07,380 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:19:07,381 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:19:07,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:19:07,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:19:07,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:19:07,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:19:07,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:19:07,383 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:19:07,383 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:19:07,383 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:19:07,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:19:07,384 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:19:07,384 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:19:07,384 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:19:07,385 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:19:07,385 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_ed3ac871-b4b9-40dd-8927-a30b44044414/bin/uautomizer-verify-4GaUIPS5ZU/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_ed3ac871-b4b9-40dd-8927-a30b44044414/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 2e33738ed6ea5e50e5f6c45ef52d667e94a1539d08a631ee5964d7b99a8f5c91 [2024-10-31 22:19:07,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:19:07,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:19:07,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:19:07,727 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:19:07,727 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:19:07,729 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed3ac871-b4b9-40dd-8927-a30b44044414/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c Unable to find full path for "g++" [2024-10-31 22:19:09,839 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:19:10,138 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:19:10,139 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed3ac871-b4b9-40dd-8927-a30b44044414/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c [2024-10-31 22:19:10,157 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed3ac871-b4b9-40dd-8927-a30b44044414/bin/uautomizer-verify-4GaUIPS5ZU/data/1e1ff9433/ad453143c5a441a98eab200790f6e783/FLAGd275d8fc3 [2024-10-31 22:19:10,173 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed3ac871-b4b9-40dd-8927-a30b44044414/bin/uautomizer-verify-4GaUIPS5ZU/data/1e1ff9433/ad453143c5a441a98eab200790f6e783 [2024-10-31 22:19:10,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:19:10,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:19:10,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:19:10,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:19:10,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:19:10,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:19:10" (1/1) ... [2024-10-31 22:19:10,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ced7a64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:10, skipping insertion in model container [2024-10-31 22:19:10,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:19:10" (1/1) ... [2024-10-31 22:19:10,257 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:19:10,652 WARN L251 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_ed3ac871-b4b9-40dd-8927-a30b44044414/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c[28368,28381] [2024-10-31 22:19:10,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:19:10,673 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:19:10,794 WARN L251 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_ed3ac871-b4b9-40dd-8927-a30b44044414/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c[28368,28381] [2024-10-31 22:19:10,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:19:10,834 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:19:10,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:10 WrapperNode [2024-10-31 22:19:10,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:19:10,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:19:10,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:19:10,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:19:10,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:10" (1/1) ... [2024-10-31 22:19:10,858 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:10" (1/1) ... [2024-10-31 22:19:10,931 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 959 [2024-10-31 22:19:10,935 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:19:10,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:19:10,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:19:10,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:19:10,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:10" (1/1) ... [2024-10-31 22:19:10,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:10" (1/1) ... [2024-10-31 22:19:10,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:10" (1/1) ... [2024-10-31 22:19:11,000 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-10-31 22:19:11,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:10" (1/1) ... [2024-10-31 22:19:11,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:10" (1/1) ... [2024-10-31 22:19:11,026 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:10" (1/1) ... [2024-10-31 22:19:11,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:10" (1/1) ... [2024-10-31 22:19:11,059 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:10" (1/1) ... [2024-10-31 22:19:11,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:10" (1/1) ... [2024-10-31 22:19:11,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:19:11,077 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:19:11,078 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:19:11,078 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:19:11,079 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:10" (1/1) ... [2024-10-31 22:19:11,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:19:11,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed3ac871-b4b9-40dd-8927-a30b44044414/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:19:11,110 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed3ac871-b4b9-40dd-8927-a30b44044414/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:19:11,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed3ac871-b4b9-40dd-8927-a30b44044414/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:19:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:19:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:19:11,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:19:11,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:19:11,305 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:19:11,307 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:19:12,644 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2024-10-31 22:19:12,644 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:19:12,676 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:19:12,680 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:19:12,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:19:12 BoogieIcfgContainer [2024-10-31 22:19:12,681 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:19:12,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:19:12,687 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:19:12,690 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:19:12,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:19:10" (1/3) ... [2024-10-31 22:19:12,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4220c225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:19:12, skipping insertion in model container [2024-10-31 22:19:12,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:10" (2/3) ... [2024-10-31 22:19:12,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4220c225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:19:12, skipping insertion in model container [2024-10-31 22:19:12,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:19:12" (3/3) ... [2024-10-31 22:19:12,693 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.2.ufo.UNBOUNDED.pals.c [2024-10-31 22:19:12,712 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:19:12,712 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:19:12,868 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:19:12,875 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;@6af5ff25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:19:12,876 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:19:12,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 288 states, 286 states have (on average 1.8251748251748252) internal successors, (522), 287 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:12,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-31 22:19:12,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:12,900 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:12,900 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:12,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:12,907 INFO L85 PathProgramCache]: Analyzing trace with hash 2117571860, now seen corresponding path program 1 times [2024-10-31 22:19:12,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:12,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017602918] [2024-10-31 22:19:12,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:12,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:13,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:13,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:13,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017602918] [2024-10-31 22:19:13,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017602918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:13,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:13,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:13,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799987852] [2024-10-31 22:19:13,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:13,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:19:13,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:13,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:19:13,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:19:13,492 INFO L87 Difference]: Start difference. First operand has 288 states, 286 states have (on average 1.8251748251748252) internal successors, (522), 287 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:13,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:13,549 INFO L93 Difference]: Finished difference Result 381 states and 687 transitions. [2024-10-31 22:19:13,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:19:13,551 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-31 22:19:13,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:13,569 INFO L225 Difference]: With dead ends: 381 [2024-10-31 22:19:13,569 INFO L226 Difference]: Without dead ends: 284 [2024-10-31 22:19:13,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:19:13,576 INFO L432 NwaCegarLoop]: 515 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, 515 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-10-31 22:19:13,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:13,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-31 22:19:13,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2024-10-31 22:19:13,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.8197879858657244) internal successors, (515), 283 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:13,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 515 transitions. [2024-10-31 22:19:13,650 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 515 transitions. Word has length 77 [2024-10-31 22:19:13,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:13,650 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 515 transitions. [2024-10-31 22:19:13,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:13,651 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 515 transitions. [2024-10-31 22:19:13,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-31 22:19:13,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:13,654 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:13,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:19:13,655 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:13,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:13,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1983558354, now seen corresponding path program 1 times [2024-10-31 22:19:13,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:13,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345869611] [2024-10-31 22:19:13,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:13,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:14,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:14,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:14,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345869611] [2024-10-31 22:19:14,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345869611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:14,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:14,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:19:14,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516180372] [2024-10-31 22:19:14,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:14,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:19:14,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:14,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:19:14,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:19:14,163 INFO L87 Difference]: Start difference. First operand 284 states and 515 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:14,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:14,329 INFO L93 Difference]: Finished difference Result 380 states and 680 transitions. [2024-10-31 22:19:14,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:19:14,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-31 22:19:14,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:14,332 INFO L225 Difference]: With dead ends: 380 [2024-10-31 22:19:14,333 INFO L226 Difference]: Without dead ends: 284 [2024-10-31 22:19:14,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:19:14,338 INFO L432 NwaCegarLoop]: 513 mSDtfsCounter, 0 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2005 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:14,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2005 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:19:14,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-31 22:19:14,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2024-10-31 22:19:14,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.6713780918727916) internal successors, (473), 283 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:14,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 473 transitions. [2024-10-31 22:19:14,363 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 473 transitions. Word has length 77 [2024-10-31 22:19:14,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:14,364 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 473 transitions. [2024-10-31 22:19:14,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:14,364 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 473 transitions. [2024-10-31 22:19:14,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-31 22:19:14,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:14,368 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:14,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:19:14,369 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:14,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:14,369 INFO L85 PathProgramCache]: Analyzing trace with hash 188392410, now seen corresponding path program 1 times [2024-10-31 22:19:14,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:14,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612436092] [2024-10-31 22:19:14,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:14,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:14,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:14,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:14,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612436092] [2024-10-31 22:19:14,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612436092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:14,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:14,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:14,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636865911] [2024-10-31 22:19:14,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:14,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:14,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:14,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:14,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:14,774 INFO L87 Difference]: Start difference. First operand 284 states and 473 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:14,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:14,851 INFO L93 Difference]: Finished difference Result 457 states and 774 transitions. [2024-10-31 22:19:14,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:14,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2024-10-31 22:19:14,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:14,855 INFO L225 Difference]: With dead ends: 457 [2024-10-31 22:19:14,855 INFO L226 Difference]: Without dead ends: 365 [2024-10-31 22:19:14,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:14,861 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 131 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:14,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 887 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:19:14,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-31 22:19:14,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2024-10-31 22:19:14,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.6759002770083102) internal successors, (605), 361 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:14,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 605 transitions. [2024-10-31 22:19:14,893 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 605 transitions. Word has length 118 [2024-10-31 22:19:14,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:14,894 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 605 transitions. [2024-10-31 22:19:14,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:14,895 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 605 transitions. [2024-10-31 22:19:14,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-31 22:19:14,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:14,897 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:14,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:19:14,898 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:14,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:14,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2086049744, now seen corresponding path program 1 times [2024-10-31 22:19:14,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:14,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763734788] [2024-10-31 22:19:14,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:14,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:15,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:15,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:15,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763734788] [2024-10-31 22:19:15,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763734788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:15,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:15,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:15,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991871908] [2024-10-31 22:19:15,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:15,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:15,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:15,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:15,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:15,174 INFO L87 Difference]: Start difference. First operand 362 states and 605 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:15,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:15,223 INFO L93 Difference]: Finished difference Result 684 states and 1157 transitions. [2024-10-31 22:19:15,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:15,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2024-10-31 22:19:15,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:15,226 INFO L225 Difference]: With dead ends: 684 [2024-10-31 22:19:15,226 INFO L226 Difference]: Without dead ends: 514 [2024-10-31 22:19:15,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:15,234 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 132 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:15,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 899 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:15,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-10-31 22:19:15,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 510. [2024-10-31 22:19:15,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.6836935166994107) internal successors, (857), 509 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:15,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 857 transitions. [2024-10-31 22:19:15,254 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 857 transitions. Word has length 121 [2024-10-31 22:19:15,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:15,255 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 857 transitions. [2024-10-31 22:19:15,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:15,256 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 857 transitions. [2024-10-31 22:19:15,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-31 22:19:15,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:15,258 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:15,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:19:15,258 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:15,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:15,259 INFO L85 PathProgramCache]: Analyzing trace with hash -623070795, now seen corresponding path program 1 times [2024-10-31 22:19:15,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:15,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419017129] [2024-10-31 22:19:15,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:15,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:15,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:15,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:15,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419017129] [2024-10-31 22:19:15,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419017129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:15,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:15,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:15,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023569995] [2024-10-31 22:19:15,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:15,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:15,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:15,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:15,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:15,513 INFO L87 Difference]: Start difference. First operand 510 states and 857 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:15,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:15,580 INFO L93 Difference]: Finished difference Result 1110 states and 1879 transitions. [2024-10-31 22:19:15,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:15,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2024-10-31 22:19:15,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:15,584 INFO L225 Difference]: With dead ends: 1110 [2024-10-31 22:19:15,584 INFO L226 Difference]: Without dead ends: 792 [2024-10-31 22:19:15,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:15,589 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 125 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:15,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 900 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:15,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2024-10-31 22:19:15,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 786. [2024-10-31 22:19:15,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.6828025477707007) internal successors, (1321), 785 states have internal predecessors, (1321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:15,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1321 transitions. [2024-10-31 22:19:15,618 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1321 transitions. Word has length 124 [2024-10-31 22:19:15,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:15,619 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1321 transitions. [2024-10-31 22:19:15,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:15,620 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1321 transitions. [2024-10-31 22:19:15,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-31 22:19:15,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:15,624 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:15,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:19:15,625 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:15,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:15,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1603254571, now seen corresponding path program 1 times [2024-10-31 22:19:15,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:15,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697504782] [2024-10-31 22:19:15,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:15,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:15,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:15,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:15,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697504782] [2024-10-31 22:19:15,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697504782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:15,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:15,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:15,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041281662] [2024-10-31 22:19:15,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:15,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:15,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:15,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:15,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:15,884 INFO L87 Difference]: Start difference. First operand 786 states and 1321 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:15,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:15,947 INFO L93 Difference]: Finished difference Result 1902 states and 3203 transitions. [2024-10-31 22:19:15,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:15,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2024-10-31 22:19:15,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:15,956 INFO L225 Difference]: With dead ends: 1902 [2024-10-31 22:19:15,956 INFO L226 Difference]: Without dead ends: 1308 [2024-10-31 22:19:15,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:15,959 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 118 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:15,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 901 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:15,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2024-10-31 22:19:15,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1298. [2024-10-31 22:19:15,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1297 states have (on average 1.6723207401696223) internal successors, (2169), 1297 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:16,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 2169 transitions. [2024-10-31 22:19:16,003 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 2169 transitions. Word has length 127 [2024-10-31 22:19:16,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:16,004 INFO L471 AbstractCegarLoop]: Abstraction has 1298 states and 2169 transitions. [2024-10-31 22:19:16,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:16,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 2169 transitions. [2024-10-31 22:19:16,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-31 22:19:16,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:16,009 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:16,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:19:16,009 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:16,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:16,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1273370830, now seen corresponding path program 1 times [2024-10-31 22:19:16,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:16,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838347065] [2024-10-31 22:19:16,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:16,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:16,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:16,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:16,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838347065] [2024-10-31 22:19:16,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838347065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:16,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:16,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:19:16,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481227547] [2024-10-31 22:19:16,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:16,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:19:16,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:16,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:19:16,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:19:16,342 INFO L87 Difference]: Start difference. First operand 1298 states and 2169 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:16,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:16,766 INFO L93 Difference]: Finished difference Result 6530 states and 11093 transitions. [2024-10-31 22:19:16,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:19:16,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2024-10-31 22:19:16,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:16,786 INFO L225 Difference]: With dead ends: 6530 [2024-10-31 22:19:16,787 INFO L226 Difference]: Without dead ends: 5424 [2024-10-31 22:19:16,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:19:16,790 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 1589 mSDsluCounter, 3043 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 3516 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:16,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1589 Valid, 3516 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:19:16,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5424 states. [2024-10-31 22:19:16,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5424 to 2326. [2024-10-31 22:19:16,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2326 states, 2325 states have (on average 1.6748387096774193) internal successors, (3894), 2325 states have internal predecessors, (3894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:16,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 3894 transitions. [2024-10-31 22:19:16,946 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 3894 transitions. Word has length 130 [2024-10-31 22:19:16,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:16,947 INFO L471 AbstractCegarLoop]: Abstraction has 2326 states and 3894 transitions. [2024-10-31 22:19:16,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:16,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 3894 transitions. [2024-10-31 22:19:16,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-31 22:19:16,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:16,952 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:16,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:19:16,952 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:16,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:16,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1274816655, now seen corresponding path program 1 times [2024-10-31 22:19:16,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:16,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60086340] [2024-10-31 22:19:16,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:16,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:17,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:17,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:17,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60086340] [2024-10-31 22:19:17,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60086340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:17,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:17,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:19:17,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629895720] [2024-10-31 22:19:17,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:17,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:19:17,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:17,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:19:17,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:19:17,205 INFO L87 Difference]: Start difference. First operand 2326 states and 3894 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:17,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:17,381 INFO L93 Difference]: Finished difference Result 6744 states and 11406 transitions. [2024-10-31 22:19:17,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:19:17,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2024-10-31 22:19:17,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:17,398 INFO L225 Difference]: With dead ends: 6744 [2024-10-31 22:19:17,398 INFO L226 Difference]: Without dead ends: 4610 [2024-10-31 22:19:17,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:19:17,402 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 457 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:17,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1511 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:19:17,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2024-10-31 22:19:17,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 3451. [2024-10-31 22:19:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3451 states, 3450 states have (on average 1.6805797101449276) internal successors, (5798), 3450 states have internal predecessors, (5798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:17,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 3451 states and 5798 transitions. [2024-10-31 22:19:17,547 INFO L78 Accepts]: Start accepts. Automaton has 3451 states and 5798 transitions. Word has length 131 [2024-10-31 22:19:17,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:17,548 INFO L471 AbstractCegarLoop]: Abstraction has 3451 states and 5798 transitions. [2024-10-31 22:19:17,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:17,548 INFO L276 IsEmpty]: Start isEmpty. Operand 3451 states and 5798 transitions. [2024-10-31 22:19:17,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-31 22:19:17,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:17,551 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:17,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:19:17,552 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:17,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:17,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1504754277, now seen corresponding path program 1 times [2024-10-31 22:19:17,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:17,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682688400] [2024-10-31 22:19:17,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:17,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:17,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:17,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:17,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682688400] [2024-10-31 22:19:17,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682688400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:17,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:17,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:19:17,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824916674] [2024-10-31 22:19:17,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:17,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:19:17,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:17,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:19:17,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:19:17,814 INFO L87 Difference]: Start difference. First operand 3451 states and 5798 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:18,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:18,061 INFO L93 Difference]: Finished difference Result 10068 states and 17008 transitions. [2024-10-31 22:19:18,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:19:18,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2024-10-31 22:19:18,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:18,082 INFO L225 Difference]: With dead ends: 10068 [2024-10-31 22:19:18,083 INFO L226 Difference]: Without dead ends: 6809 [2024-10-31 22:19:18,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:19:18,089 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 457 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:18,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1424 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:19:18,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6809 states. [2024-10-31 22:19:18,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6809 to 5106. [2024-10-31 22:19:18,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5106 states, 5105 states have (on average 1.6789422135161607) internal successors, (8571), 5105 states have internal predecessors, (8571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:18,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5106 states to 5106 states and 8571 transitions. [2024-10-31 22:19:18,273 INFO L78 Accepts]: Start accepts. Automaton has 5106 states and 8571 transitions. Word has length 132 [2024-10-31 22:19:18,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:18,274 INFO L471 AbstractCegarLoop]: Abstraction has 5106 states and 8571 transitions. [2024-10-31 22:19:18,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:18,274 INFO L276 IsEmpty]: Start isEmpty. Operand 5106 states and 8571 transitions. [2024-10-31 22:19:18,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-31 22:19:18,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:18,278 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:18,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:19:18,279 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:18,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:18,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1944006777, now seen corresponding path program 1 times [2024-10-31 22:19:18,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:18,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845821151] [2024-10-31 22:19:18,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:18,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:18,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:18,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845821151] [2024-10-31 22:19:18,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845821151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:18,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:18,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:18,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948075631] [2024-10-31 22:19:18,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:18,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:18,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:18,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:18,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:18,429 INFO L87 Difference]: Start difference. First operand 5106 states and 8571 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:18,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:18,621 INFO L93 Difference]: Finished difference Result 11425 states and 19299 transitions. [2024-10-31 22:19:18,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:18,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2024-10-31 22:19:18,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:18,652 INFO L225 Difference]: With dead ends: 11425 [2024-10-31 22:19:18,653 INFO L226 Difference]: Without dead ends: 7909 [2024-10-31 22:19:18,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:18,658 INFO L432 NwaCegarLoop]: 592 mSDtfsCounter, 138 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:18,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1043 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:19:18,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7909 states. [2024-10-31 22:19:18,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7909 to 7907. [2024-10-31 22:19:18,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7907 states, 7906 states have (on average 1.6750569187958513) internal successors, (13243), 7906 states have internal predecessors, (13243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:18,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7907 states to 7907 states and 13243 transitions. [2024-10-31 22:19:18,880 INFO L78 Accepts]: Start accepts. Automaton has 7907 states and 13243 transitions. Word has length 133 [2024-10-31 22:19:18,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:18,880 INFO L471 AbstractCegarLoop]: Abstraction has 7907 states and 13243 transitions. [2024-10-31 22:19:18,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:18,881 INFO L276 IsEmpty]: Start isEmpty. Operand 7907 states and 13243 transitions. [2024-10-31 22:19:18,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-31 22:19:18,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:18,884 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:18,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:19:18,885 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:18,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:18,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1941111592, now seen corresponding path program 1 times [2024-10-31 22:19:18,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:18,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340456108] [2024-10-31 22:19:18,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:18,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:19,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:19,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:19,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340456108] [2024-10-31 22:19:19,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340456108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:19,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:19,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:19:19,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878530261] [2024-10-31 22:19:19,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:19,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:19:19,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:19,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:19:19,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:19:19,178 INFO L87 Difference]: Start difference. First operand 7907 states and 13243 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:19,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:19,528 INFO L93 Difference]: Finished difference Result 23494 states and 39550 transitions. [2024-10-31 22:19:19,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:19:19,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2024-10-31 22:19:19,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:19,565 INFO L225 Difference]: With dead ends: 23494 [2024-10-31 22:19:19,565 INFO L226 Difference]: Without dead ends: 15781 [2024-10-31 22:19:19,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:19:19,577 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 455 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:19,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1518 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:19:19,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15781 states. [2024-10-31 22:19:19,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15781 to 11788. [2024-10-31 22:19:19,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11788 states, 11787 states have (on average 1.6726054127428522) internal successors, (19715), 11787 states have internal predecessors, (19715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:19,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11788 states to 11788 states and 19715 transitions. [2024-10-31 22:19:19,991 INFO L78 Accepts]: Start accepts. Automaton has 11788 states and 19715 transitions. Word has length 133 [2024-10-31 22:19:19,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:19,992 INFO L471 AbstractCegarLoop]: Abstraction has 11788 states and 19715 transitions. [2024-10-31 22:19:19,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:19,993 INFO L276 IsEmpty]: Start isEmpty. Operand 11788 states and 19715 transitions. [2024-10-31 22:19:19,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-31 22:19:19,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:19,995 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:19,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:19:19,996 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:19,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:19,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1631061960, now seen corresponding path program 1 times [2024-10-31 22:19:19,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:19,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859821267] [2024-10-31 22:19:19,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:19,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:20,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:20,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859821267] [2024-10-31 22:19:20,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859821267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:20,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:20,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:20,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628156052] [2024-10-31 22:19:20,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:20,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:20,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:20,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:20,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:20,148 INFO L87 Difference]: Start difference. First operand 11788 states and 19715 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:20,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:20,456 INFO L93 Difference]: Finished difference Result 23685 states and 39649 transitions. [2024-10-31 22:19:20,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:20,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2024-10-31 22:19:20,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:20,492 INFO L225 Difference]: With dead ends: 23685 [2024-10-31 22:19:20,492 INFO L226 Difference]: Without dead ends: 17075 [2024-10-31 22:19:20,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:20,500 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 117 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:20,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 985 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:19:20,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17075 states. [2024-10-31 22:19:21,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17075 to 17073. [2024-10-31 22:19:21,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17073 states, 17072 states have (on average 1.6617268041237114) internal successors, (28369), 17072 states have internal predecessors, (28369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:21,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17073 states to 17073 states and 28369 transitions. [2024-10-31 22:19:21,066 INFO L78 Accepts]: Start accepts. Automaton has 17073 states and 28369 transitions. Word has length 133 [2024-10-31 22:19:21,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:21,067 INFO L471 AbstractCegarLoop]: Abstraction has 17073 states and 28369 transitions. [2024-10-31 22:19:21,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:21,067 INFO L276 IsEmpty]: Start isEmpty. Operand 17073 states and 28369 transitions. [2024-10-31 22:19:21,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-31 22:19:21,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:21,069 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:21,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:19:21,070 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:21,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:21,072 INFO L85 PathProgramCache]: Analyzing trace with hash -15643545, now seen corresponding path program 1 times [2024-10-31 22:19:21,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:21,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691112635] [2024-10-31 22:19:21,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:21,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:21,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:21,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691112635] [2024-10-31 22:19:21,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691112635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:21,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:21,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:21,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758335477] [2024-10-31 22:19:21,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:21,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:21,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:21,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:21,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:21,226 INFO L87 Difference]: Start difference. First operand 17073 states and 28369 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:21,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:21,808 INFO L93 Difference]: Finished difference Result 38023 states and 63245 transitions. [2024-10-31 22:19:21,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:21,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2024-10-31 22:19:21,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:21,874 INFO L225 Difference]: With dead ends: 38023 [2024-10-31 22:19:21,874 INFO L226 Difference]: Without dead ends: 26128 [2024-10-31 22:19:21,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:21,893 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 124 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:21,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1013 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:19:21,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26128 states. [2024-10-31 22:19:22,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26128 to 26126. [2024-10-31 22:19:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26126 states, 26125 states have (on average 1.6492631578947368) internal successors, (43087), 26125 states have internal predecessors, (43087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26126 states to 26126 states and 43087 transitions. [2024-10-31 22:19:22,746 INFO L78 Accepts]: Start accepts. Automaton has 26126 states and 43087 transitions. Word has length 133 [2024-10-31 22:19:22,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:22,747 INFO L471 AbstractCegarLoop]: Abstraction has 26126 states and 43087 transitions. [2024-10-31 22:19:22,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:22,747 INFO L276 IsEmpty]: Start isEmpty. Operand 26126 states and 43087 transitions. [2024-10-31 22:19:22,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-31 22:19:22,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:22,749 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:22,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:19:22,749 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:22,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:22,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2123016934, now seen corresponding path program 1 times [2024-10-31 22:19:22,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:22,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220103401] [2024-10-31 22:19:22,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:22,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:22,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:22,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:22,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220103401] [2024-10-31 22:19:22,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220103401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:22,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:22,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:22,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907444113] [2024-10-31 22:19:22,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:22,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:22,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:22,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:22,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:22,890 INFO L87 Difference]: Start difference. First operand 26126 states and 43087 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:23,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:23,647 INFO L93 Difference]: Finished difference Result 58253 states and 96104 transitions. [2024-10-31 22:19:23,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:23,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2024-10-31 22:19:23,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:23,726 INFO L225 Difference]: With dead ends: 58253 [2024-10-31 22:19:23,727 INFO L226 Difference]: Without dead ends: 39892 [2024-10-31 22:19:23,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:23,749 INFO L432 NwaCegarLoop]: 590 mSDtfsCounter, 131 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:23,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1042 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:19:23,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39892 states. [2024-10-31 22:19:24,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39892 to 39890. [2024-10-31 22:19:24,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39890 states, 39889 states have (on average 1.633708541201835) internal successors, (65167), 39889 states have internal predecessors, (65167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:24,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39890 states to 39890 states and 65167 transitions. [2024-10-31 22:19:24,969 INFO L78 Accepts]: Start accepts. Automaton has 39890 states and 65167 transitions. Word has length 133 [2024-10-31 22:19:24,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:24,970 INFO L471 AbstractCegarLoop]: Abstraction has 39890 states and 65167 transitions. [2024-10-31 22:19:24,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:24,970 INFO L276 IsEmpty]: Start isEmpty. Operand 39890 states and 65167 transitions. [2024-10-31 22:19:24,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-31 22:19:24,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:24,972 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:24,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:19:24,973 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:24,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:24,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1542676484, now seen corresponding path program 1 times [2024-10-31 22:19:24,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:24,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111086231] [2024-10-31 22:19:24,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:24,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:25,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:25,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111086231] [2024-10-31 22:19:25,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111086231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:25,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:25,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:19:25,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768848311] [2024-10-31 22:19:25,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:25,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:19:25,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:25,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:19:25,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:19:25,261 INFO L87 Difference]: Start difference. First operand 39890 states and 65167 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:26,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:26,878 INFO L93 Difference]: Finished difference Result 129245 states and 211740 transitions. [2024-10-31 22:19:26,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:19:26,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2024-10-31 22:19:26,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:27,128 INFO L225 Difference]: With dead ends: 129245 [2024-10-31 22:19:27,128 INFO L226 Difference]: Without dead ends: 89570 [2024-10-31 22:19:27,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:19:27,181 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 453 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:27,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1505 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:19:27,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89570 states. [2024-10-31 22:19:29,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89570 to 64505. [2024-10-31 22:19:29,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64505 states, 64504 states have (on average 1.626658811856629) internal successors, (104926), 64504 states have internal predecessors, (104926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64505 states to 64505 states and 104926 transitions. [2024-10-31 22:19:29,462 INFO L78 Accepts]: Start accepts. Automaton has 64505 states and 104926 transitions. Word has length 134 [2024-10-31 22:19:29,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:29,462 INFO L471 AbstractCegarLoop]: Abstraction has 64505 states and 104926 transitions. [2024-10-31 22:19:29,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:29,463 INFO L276 IsEmpty]: Start isEmpty. Operand 64505 states and 104926 transitions. [2024-10-31 22:19:29,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-31 22:19:29,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:29,464 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:29,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 22:19:29,465 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:29,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:29,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1330430292, now seen corresponding path program 1 times [2024-10-31 22:19:29,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:29,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23244383] [2024-10-31 22:19:29,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:29,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:30,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:30,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:30,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23244383] [2024-10-31 22:19:30,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23244383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:30,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:30,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:19:30,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444358595] [2024-10-31 22:19:30,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:30,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:19:30,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:30,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:19:30,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:19:30,166 INFO L87 Difference]: Start difference. First operand 64505 states and 104926 transitions. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:31,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:31,470 INFO L93 Difference]: Finished difference Result 128797 states and 209509 transitions. [2024-10-31 22:19:31,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:19:31,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2024-10-31 22:19:31,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:19:31,621 INFO L225 Difference]: With dead ends: 128797 [2024-10-31 22:19:31,621 INFO L226 Difference]: Without dead ends: 64507 [2024-10-31 22:19:31,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:19:31,657 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 479 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:19:31,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1781 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:19:31,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64507 states. [2024-10-31 22:19:32,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64507 to 64505. [2024-10-31 22:19:33,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64505 states, 64504 states have (on average 1.6169694902641696) internal successors, (104301), 64504 states have internal predecessors, (104301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64505 states to 64505 states and 104301 transitions. [2024-10-31 22:19:33,262 INFO L78 Accepts]: Start accepts. Automaton has 64505 states and 104301 transitions. Word has length 136 [2024-10-31 22:19:33,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:19:33,263 INFO L471 AbstractCegarLoop]: Abstraction has 64505 states and 104301 transitions. [2024-10-31 22:19:33,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:33,264 INFO L276 IsEmpty]: Start isEmpty. Operand 64505 states and 104301 transitions. [2024-10-31 22:19:33,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-31 22:19:33,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:19:33,266 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:33,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 22:19:33,266 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:19:33,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:33,267 INFO L85 PathProgramCache]: Analyzing trace with hash -156781653, now seen corresponding path program 1 times [2024-10-31 22:19:33,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:33,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088161383] [2024-10-31 22:19:33,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:33,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:33,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:33,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088161383] [2024-10-31 22:19:33,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088161383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:33,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:33,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:19:33,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428537941] [2024-10-31 22:19:33,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:33,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:19:33,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:33,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:19:33,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:19:33,866 INFO L87 Difference]: Start difference. First operand 64505 states and 104301 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:35,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:19:35,625 INFO L93 Difference]: Finished difference Result 188667 states and 305529 transitions. [2024-10-31 22:19:35,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:19:35,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2024-10-31 22:19:35,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted.