./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff 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_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-76.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu --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 dcd8b7c9719c9e124f88c0306e66fdc794df6c79afaa727af6840898442d18a1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:53:32,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:53:32,945 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:53:32,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:53:32,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:53:32,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:53:32,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:53:32,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:53:32,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:53:32,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:53:32,989 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:53:32,989 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:53:32,990 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:53:32,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:53:32,991 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:53:32,992 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:53:32,992 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:53:32,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:53:32,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:53:32,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:53:32,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:53:32,994 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:53:32,995 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:53:32,996 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:53:32,996 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:53:33,001 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:53:33,002 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:53:33,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:53:33,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:53:33,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:53:33,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:53:33,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:53:33,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:53:33,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:53:33,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:53:33,007 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:53:33,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:53:33,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:53:33,007 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:53:33,008 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_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu/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_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu 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 -> dcd8b7c9719c9e124f88c0306e66fdc794df6c79afaa727af6840898442d18a1 [2023-11-19 07:53:33,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:53:33,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:53:33,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:53:33,358 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:53:33,359 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:53:33,360 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-76.i [2023-11-19 07:53:36,453 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:53:36,717 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:53:36,718 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-76.i [2023-11-19 07:53:36,726 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu/data/05999f70d/c1db6a03b9af41f78b2f7dee2ba7eb81/FLAG26cfffc12 [2023-11-19 07:53:36,740 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu/data/05999f70d/c1db6a03b9af41f78b2f7dee2ba7eb81 [2023-11-19 07:53:36,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:53:36,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:53:36,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:53:36,745 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:53:36,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:53:36,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:53:36" (1/1) ... [2023-11-19 07:53:36,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49239620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:36, skipping insertion in model container [2023-11-19 07:53:36,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:53:36" (1/1) ... [2023-11-19 07:53:36,790 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:53:36,937 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-76.i[916,929] [2023-11-19 07:53:37,003 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:53:37,015 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:53:37,028 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-76.i[916,929] [2023-11-19 07:53:37,064 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:53:37,094 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:53:37,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:37 WrapperNode [2023-11-19 07:53:37,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:53:37,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:53:37,097 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:53:37,097 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:53:37,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:37" (1/1) ... [2023-11-19 07:53:37,133 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:37" (1/1) ... [2023-11-19 07:53:37,191 INFO L138 Inliner]: procedures = 29, calls = 134, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 362 [2023-11-19 07:53:37,192 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:53:37,192 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:53:37,193 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:53:37,194 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:53:37,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:37" (1/1) ... [2023-11-19 07:53:37,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:37" (1/1) ... [2023-11-19 07:53:37,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:37" (1/1) ... [2023-11-19 07:53:37,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:37" (1/1) ... [2023-11-19 07:53:37,261 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:37" (1/1) ... [2023-11-19 07:53:37,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:37" (1/1) ... [2023-11-19 07:53:37,282 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:37" (1/1) ... [2023-11-19 07:53:37,285 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:37" (1/1) ... [2023-11-19 07:53:37,289 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:53:37,291 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:53:37,291 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:53:37,291 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:53:37,292 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:37" (1/1) ... [2023-11-19 07:53:37,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:53:37,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:53:37,326 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:53:37,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:53:37,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:53:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-19 07:53:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:53:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-19 07:53:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:53:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-19 07:53:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:53:37,377 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:53:37,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:53:37,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:53:37,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:53:37,481 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:53:37,484 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:53:38,092 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:53:38,110 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:53:38,113 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:53:38,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:53:38 BoogieIcfgContainer [2023-11-19 07:53:38,121 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:53:38,124 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:53:38,126 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:53:38,129 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:53:38,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:53:36" (1/3) ... [2023-11-19 07:53:38,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e48be76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:53:38, skipping insertion in model container [2023-11-19 07:53:38,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:37" (2/3) ... [2023-11-19 07:53:38,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e48be76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:53:38, skipping insertion in model container [2023-11-19 07:53:38,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:53:38" (3/3) ... [2023-11-19 07:53:38,135 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-76.i [2023-11-19 07:53:38,155 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:53:38,155 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:53:38,226 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:53:38,235 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@44a728c7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:53:38,236 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:53:38,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:53:38,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-19 07:53:38,266 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:53:38,267 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:53:38,268 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:53:38,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:38,278 INFO L85 PathProgramCache]: Analyzing trace with hash -2020212237, now seen corresponding path program 1 times [2023-11-19 07:53:38,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:38,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663923722] [2023-11-19 07:53:38,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:38,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:38,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:53:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:38,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:53:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:38,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:53:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:38,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:53:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:38,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:53:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:38,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:53:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:38,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:53:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:38,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:53:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:38,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:53:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:38,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:53:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:38,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:53:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:38,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:53:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:38,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:53:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:38,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:53:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:38,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:53:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:38,763 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:53:38,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:38,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663923722] [2023-11-19 07:53:38,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663923722] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:53:38,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:53:38,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:53:38,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936688442] [2023-11-19 07:53:38,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:53:38,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:53:38,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:53:38,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:53:38,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:53:38,832 INFO L87 Difference]: Start difference. First operand has 102 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:53:38,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:53:38,886 INFO L93 Difference]: Finished difference Result 193 states and 301 transitions. [2023-11-19 07:53:38,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:53:38,889 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2023-11-19 07:53:38,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:53:38,897 INFO L225 Difference]: With dead ends: 193 [2023-11-19 07:53:38,897 INFO L226 Difference]: Without dead ends: 94 [2023-11-19 07:53:38,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:53:38,905 INFO L413 NwaCegarLoop]: 133 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, 133 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 [2023-11-19 07:53:38,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:53:38,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-19 07:53:38,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-11-19 07:53:38,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:53:38,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2023-11-19 07:53:38,964 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 133 transitions. Word has length 119 [2023-11-19 07:53:38,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:53:38,965 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 133 transitions. [2023-11-19 07:53:38,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:53:38,966 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 133 transitions. [2023-11-19 07:53:38,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-19 07:53:38,978 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:53:38,978 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:53:38,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:53:38,979 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:53:38,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:38,981 INFO L85 PathProgramCache]: Analyzing trace with hash 189444987, now seen corresponding path program 1 times [2023-11-19 07:53:38,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:38,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995776506] [2023-11-19 07:53:38,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:38,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:53:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:53:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:53:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:53:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:53:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:53:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:53:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:53:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:53:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:53:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:53:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:53:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:53:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:53:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:53:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,427 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:53:39,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:39,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995776506] [2023-11-19 07:53:39,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995776506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:53:39,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:53:39,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:53:39,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616494705] [2023-11-19 07:53:39,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:53:39,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:53:39,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:53:39,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:53:39,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:53:39,442 INFO L87 Difference]: Start difference. First operand 94 states and 133 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:53:39,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:53:39,538 INFO L93 Difference]: Finished difference Result 191 states and 272 transitions. [2023-11-19 07:53:39,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:53:39,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2023-11-19 07:53:39,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:53:39,549 INFO L225 Difference]: With dead ends: 191 [2023-11-19 07:53:39,549 INFO L226 Difference]: Without dead ends: 100 [2023-11-19 07:53:39,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:53:39,553 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 10 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:53:39,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 387 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:53:39,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-19 07:53:39,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2023-11-19 07:53:39,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 states have internal predecessors, (105), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:53:39,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2023-11-19 07:53:39,588 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 119 [2023-11-19 07:53:39,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:53:39,588 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2023-11-19 07:53:39,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:53:39,589 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2023-11-19 07:53:39,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-19 07:53:39,627 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:53:39,628 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:53:39,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:53:39,629 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:53:39,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:39,629 INFO L85 PathProgramCache]: Analyzing trace with hash -649588675, now seen corresponding path program 1 times [2023-11-19 07:53:39,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:39,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699336864] [2023-11-19 07:53:39,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:39,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:53:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:53:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:53:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:53:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:53:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:53:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:53:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:53:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:53:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:53:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:53:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:53:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:53:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:53:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:53:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,943 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:53:39,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:39,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699336864] [2023-11-19 07:53:39,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699336864] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:53:39,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:53:39,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:53:39,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186018671] [2023-11-19 07:53:39,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:53:39,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:53:39,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:53:39,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:53:39,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:53:39,946 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:53:39,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:53:39,963 INFO L93 Difference]: Finished difference Result 189 states and 267 transitions. [2023-11-19 07:53:39,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:53:39,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-11-19 07:53:39,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:53:39,966 INFO L225 Difference]: With dead ends: 189 [2023-11-19 07:53:39,966 INFO L226 Difference]: Without dead ends: 96 [2023-11-19 07:53:39,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:53:39,975 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:53:39,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:53:39,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-19 07:53:39,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-11-19 07:53:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 79 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:53:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 134 transitions. [2023-11-19 07:53:39,989 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 134 transitions. Word has length 119 [2023-11-19 07:53:39,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:53:39,991 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 134 transitions. [2023-11-19 07:53:39,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:53:39,991 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 134 transitions. [2023-11-19 07:53:39,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-19 07:53:39,995 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:53:39,995 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:53:39,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:53:39,996 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:53:39,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:39,997 INFO L85 PathProgramCache]: Analyzing trace with hash 4751163, now seen corresponding path program 1 times [2023-11-19 07:53:39,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:39,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185101999] [2023-11-19 07:53:39,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:39,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:40,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:53:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:40,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:53:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:40,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:53:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:40,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:53:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:40,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:53:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:40,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:53:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:40,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:53:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:40,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:53:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:40,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:53:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:40,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:53:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:40,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:53:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:40,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:53:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:40,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:53:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:40,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:53:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:40,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:53:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:40,431 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:53:40,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:40,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185101999] [2023-11-19 07:53:40,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185101999] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:53:40,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:53:40,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:53:40,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968808668] [2023-11-19 07:53:40,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:53:40,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:53:40,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:53:40,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:53:40,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:53:40,435 INFO L87 Difference]: Start difference. First operand 96 states and 134 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:53:40,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:53:40,747 INFO L93 Difference]: Finished difference Result 234 states and 328 transitions. [2023-11-19 07:53:40,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:53:40,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2023-11-19 07:53:40,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:53:40,750 INFO L225 Difference]: With dead ends: 234 [2023-11-19 07:53:40,750 INFO L226 Difference]: Without dead ends: 141 [2023-11-19 07:53:40,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:53:40,753 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 138 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:53:40,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 251 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:53:40,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-19 07:53:40,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 96. [2023-11-19 07:53:40,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:53:40,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 133 transitions. [2023-11-19 07:53:40,768 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 133 transitions. Word has length 120 [2023-11-19 07:53:40,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:53:40,769 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 133 transitions. [2023-11-19 07:53:40,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:53:40,770 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 133 transitions. [2023-11-19 07:53:40,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-19 07:53:40,772 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:53:40,772 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:53:40,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:53:40,773 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:53:40,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:40,773 INFO L85 PathProgramCache]: Analyzing trace with hash 427452989, now seen corresponding path program 1 times [2023-11-19 07:53:40,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:40,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568151089] [2023-11-19 07:53:40,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:40,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:53:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:53:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:53:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:53:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:53:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:53:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:53:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:53:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:53:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:53:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:53:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:53:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:53:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:53:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:53:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:53:43,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:43,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568151089] [2023-11-19 07:53:43,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568151089] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:53:43,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:53:43,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:53:43,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267445217] [2023-11-19 07:53:43,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:53:43,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:53:43,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:53:43,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:53:43,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:53:43,160 INFO L87 Difference]: Start difference. First operand 96 states and 133 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:53:43,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:53:43,763 INFO L93 Difference]: Finished difference Result 246 states and 338 transitions. [2023-11-19 07:53:43,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:53:43,764 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 120 [2023-11-19 07:53:43,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:53:43,766 INFO L225 Difference]: With dead ends: 246 [2023-11-19 07:53:43,766 INFO L226 Difference]: Without dead ends: 153 [2023-11-19 07:53:43,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:53:43,768 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 190 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:53:43,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 501 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:53:43,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-11-19 07:53:43,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 110. [2023-11-19 07:53:43,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 92 states have internal predecessors, (120), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:53:43,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 150 transitions. [2023-11-19 07:53:43,787 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 150 transitions. Word has length 120 [2023-11-19 07:53:43,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:53:43,788 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 150 transitions. [2023-11-19 07:53:43,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:53:43,788 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 150 transitions. [2023-11-19 07:53:43,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-19 07:53:43,790 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:53:43,790 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:53:43,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:53:43,791 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:53:43,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:43,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1480347512, now seen corresponding path program 1 times [2023-11-19 07:53:43,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:43,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666434936] [2023-11-19 07:53:43,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:43,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:53:43,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:53:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:53:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:53:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:53:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:53:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:53:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:53:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:53:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:53:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:53:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:53:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:53:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:53:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:53:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:43,957 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:53:43,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:43,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666434936] [2023-11-19 07:53:43,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666434936] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:53:43,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:53:43,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:53:43,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040330142] [2023-11-19 07:53:43,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:53:43,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:53:43,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:53:43,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:53:43,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:53:43,961 INFO L87 Difference]: Start difference. First operand 110 states and 150 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:53:43,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:53:43,981 INFO L93 Difference]: Finished difference Result 235 states and 323 transitions. [2023-11-19 07:53:43,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:53:43,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2023-11-19 07:53:43,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:53:43,984 INFO L225 Difference]: With dead ends: 235 [2023-11-19 07:53:43,984 INFO L226 Difference]: Without dead ends: 128 [2023-11-19 07:53:43,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:53:43,986 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 33 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:53:43,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 273 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:53:43,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-19 07:53:44,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 110. [2023-11-19 07:53:44,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:53:44,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 149 transitions. [2023-11-19 07:53:44,016 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 149 transitions. Word has length 122 [2023-11-19 07:53:44,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:53:44,017 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 149 transitions. [2023-11-19 07:53:44,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:53:44,017 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 149 transitions. [2023-11-19 07:53:44,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-19 07:53:44,018 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:53:44,019 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:53:44,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:53:44,019 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:53:44,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:44,020 INFO L85 PathProgramCache]: Analyzing trace with hash -725682600, now seen corresponding path program 1 times [2023-11-19 07:53:44,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:44,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248080745] [2023-11-19 07:53:44,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:44,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:53:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:53:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:53:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:53:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:53:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:53:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:53:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:53:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:53:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:53:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:53:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:53:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:53:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:53:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:53:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,231 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:53:45,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:45,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248080745] [2023-11-19 07:53:45,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248080745] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:53:45,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:53:45,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:53:45,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083613532] [2023-11-19 07:53:45,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:53:45,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:53:45,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:53:45,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:53:45,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:53:45,234 INFO L87 Difference]: Start difference. First operand 110 states and 149 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:53:45,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:53:45,690 INFO L93 Difference]: Finished difference Result 295 states and 399 transitions. [2023-11-19 07:53:45,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:53:45,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2023-11-19 07:53:45,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:53:45,693 INFO L225 Difference]: With dead ends: 295 [2023-11-19 07:53:45,693 INFO L226 Difference]: Without dead ends: 188 [2023-11-19 07:53:45,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:53:45,694 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 104 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:53:45,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 462 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:53:45,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-11-19 07:53:45,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 110. [2023-11-19 07:53:45,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.2826086956521738) internal successors, (118), 92 states have internal predecessors, (118), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:53:45,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 148 transitions. [2023-11-19 07:53:45,715 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 148 transitions. Word has length 122 [2023-11-19 07:53:45,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:53:45,715 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 148 transitions. [2023-11-19 07:53:45,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:53:45,716 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 148 transitions. [2023-11-19 07:53:45,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:53:45,717 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:53:45,718 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:53:45,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:53:45,718 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:53:45,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:45,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1213675190, now seen corresponding path program 1 times [2023-11-19 07:53:45,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:45,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639372730] [2023-11-19 07:53:45,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:45,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:53:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:53:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:53:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:53:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:53:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:53:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:53:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:53:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:53:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:53:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:53:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:53:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:53:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:53:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:53:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:45,976 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:53:45,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:45,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639372730] [2023-11-19 07:53:45,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639372730] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:53:45,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:53:45,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:53:45,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843101743] [2023-11-19 07:53:45,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:53:45,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:53:45,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:53:45,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:53:45,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:53:45,979 INFO L87 Difference]: Start difference. First operand 110 states and 148 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:53:46,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:53:46,067 INFO L93 Difference]: Finished difference Result 237 states and 321 transitions. [2023-11-19 07:53:46,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:53:46,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-19 07:53:46,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:53:46,070 INFO L225 Difference]: With dead ends: 237 [2023-11-19 07:53:46,070 INFO L226 Difference]: Without dead ends: 130 [2023-11-19 07:53:46,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:53:46,073 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 98 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:53:46,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 631 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:53:46,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-19 07:53:46,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 114. [2023-11-19 07:53:46,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 96 states have internal predecessors, (122), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:53:46,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 152 transitions. [2023-11-19 07:53:46,093 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 152 transitions. Word has length 124 [2023-11-19 07:53:46,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:53:46,093 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 152 transitions. [2023-11-19 07:53:46,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:53:46,094 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 152 transitions. [2023-11-19 07:53:46,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:53:46,095 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:53:46,096 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:53:46,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:53:46,096 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:53:46,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:46,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1518996242, now seen corresponding path program 1 times [2023-11-19 07:53:46,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:46,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546351090] [2023-11-19 07:53:46,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:46,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:46,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:53:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:46,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:53:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:46,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:53:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:46,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:53:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:46,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:53:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:46,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:53:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:46,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:53:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:46,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:53:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:46,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:53:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:46,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:53:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:46,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:53:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:46,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:53:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:46,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:53:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:46,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:53:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:46,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:53:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:46,227 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:53:46,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:46,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546351090] [2023-11-19 07:53:46,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546351090] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:53:46,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:53:46,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:53:46,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599208995] [2023-11-19 07:53:46,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:53:46,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:53:46,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:53:46,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:53:46,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:53:46,230 INFO L87 Difference]: Start difference. First operand 114 states and 152 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:53:46,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:53:46,266 INFO L93 Difference]: Finished difference Result 227 states and 305 transitions. [2023-11-19 07:53:46,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:53:46,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-19 07:53:46,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:53:46,269 INFO L225 Difference]: With dead ends: 227 [2023-11-19 07:53:46,269 INFO L226 Difference]: Without dead ends: 116 [2023-11-19 07:53:46,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:53:46,272 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:53:46,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 252 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:53:46,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-19 07:53:46,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2023-11-19 07:53:46,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.2653061224489797) internal successors, (124), 98 states have internal predecessors, (124), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:53:46,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 154 transitions. [2023-11-19 07:53:46,290 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 154 transitions. Word has length 124 [2023-11-19 07:53:46,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:53:46,290 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 154 transitions. [2023-11-19 07:53:46,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:53:46,291 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 154 transitions. [2023-11-19 07:53:46,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:53:46,293 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:53:46,294 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:53:46,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:53:46,294 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:53:46,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:46,295 INFO L85 PathProgramCache]: Analyzing trace with hash 507878992, now seen corresponding path program 1 times [2023-11-19 07:53:46,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:46,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011943858] [2023-11-19 07:53:46,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:46,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:47,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:53:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:47,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:53:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:47,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:53:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:47,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:53:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:47,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:53:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:47,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:53:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:47,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:53:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:47,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:53:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:47,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:53:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:47,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:53:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:47,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:53:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:47,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:53:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:47,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:53:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:47,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:53:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:47,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:53:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:47,622 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:53:47,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:47,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011943858] [2023-11-19 07:53:47,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011943858] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:53:47,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:53:47,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:53:47,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274332610] [2023-11-19 07:53:47,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:53:47,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:53:47,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:53:47,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:53:47,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:53:47,625 INFO L87 Difference]: Start difference. First operand 116 states and 154 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:53:48,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:53:48,166 INFO L93 Difference]: Finished difference Result 290 states and 382 transitions. [2023-11-19 07:53:48,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:53:48,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2023-11-19 07:53:48,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:53:48,168 INFO L225 Difference]: With dead ends: 290 [2023-11-19 07:53:48,168 INFO L226 Difference]: Without dead ends: 177 [2023-11-19 07:53:48,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:53:48,170 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 133 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:53:48,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 567 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:53:48,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-11-19 07:53:48,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 115. [2023-11-19 07:53:48,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 97 states have (on average 1.2577319587628866) internal successors, (122), 97 states have internal predecessors, (122), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:53:48,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 152 transitions. [2023-11-19 07:53:48,192 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 152 transitions. Word has length 124 [2023-11-19 07:53:48,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:53:48,193 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 152 transitions. [2023-11-19 07:53:48,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:53:48,193 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 152 transitions. [2023-11-19 07:53:48,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-19 07:53:48,195 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:53:48,195 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:53:48,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:53:48,196 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:53:48,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:48,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1018530735, now seen corresponding path program 1 times [2023-11-19 07:53:48,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:48,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667440431] [2023-11-19 07:53:48,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:48,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:49,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:53:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:49,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:53:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:49,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:53:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:49,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:53:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:49,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:53:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:49,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:53:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:49,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:53:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:49,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:53:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:49,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:53:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:49,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:53:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:49,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:53:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:49,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:53:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:49,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:53:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:49,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:53:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:49,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:53:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:49,299 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:53:49,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:49,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667440431] [2023-11-19 07:53:49,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667440431] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:53:49,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:53:49,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:53:49,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416709043] [2023-11-19 07:53:49,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:53:49,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:53:49,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:53:49,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:53:49,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:53:49,303 INFO L87 Difference]: Start difference. First operand 115 states and 152 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:53:49,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:53:49,786 INFO L93 Difference]: Finished difference Result 319 states and 424 transitions. [2023-11-19 07:53:49,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:53:49,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2023-11-19 07:53:49,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:53:49,791 INFO L225 Difference]: With dead ends: 319 [2023-11-19 07:53:49,791 INFO L226 Difference]: Without dead ends: 207 [2023-11-19 07:53:49,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:53:49,792 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 143 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:53:49,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 573 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:53:49,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-11-19 07:53:49,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 117. [2023-11-19 07:53:49,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 99 states have internal predecessors, (124), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:53:49,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 154 transitions. [2023-11-19 07:53:49,815 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 154 transitions. Word has length 126 [2023-11-19 07:53:49,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:53:49,816 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 154 transitions. [2023-11-19 07:53:49,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:53:49,816 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 154 transitions. [2023-11-19 07:53:49,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-19 07:53:49,818 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:53:49,818 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:53:49,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:53:49,819 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:53:49,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:49,819 INFO L85 PathProgramCache]: Analyzing trace with hash -470688275, now seen corresponding path program 1 times [2023-11-19 07:53:49,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:49,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153165864] [2023-11-19 07:53:49,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:49,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:51,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:53:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:51,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:53:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:51,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:53:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:51,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:53:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:51,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:53:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:51,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:53:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:51,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:53:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:51,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:53:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:51,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:53:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:51,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:53:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:51,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:53:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:51,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:53:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:51,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:53:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:51,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:53:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:51,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:53:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:51,111 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:53:51,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:51,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153165864] [2023-11-19 07:53:51,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153165864] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:53:51,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:53:51,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:53:51,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464767768] [2023-11-19 07:53:51,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:53:51,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:53:51,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:53:51,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:53:51,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:53:51,114 INFO L87 Difference]: Start difference. First operand 117 states and 154 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:53:51,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:53:51,367 INFO L93 Difference]: Finished difference Result 245 states and 322 transitions. [2023-11-19 07:53:51,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:53:51,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2023-11-19 07:53:51,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:53:51,372 INFO L225 Difference]: With dead ends: 245 [2023-11-19 07:53:51,372 INFO L226 Difference]: Without dead ends: 131 [2023-11-19 07:53:51,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:53:51,374 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 105 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:53:51,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 391 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:53:51,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-19 07:53:51,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 117. [2023-11-19 07:53:51,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 99 states have (on average 1.2424242424242424) internal successors, (123), 99 states have internal predecessors, (123), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 07:53:51,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 153 transitions. [2023-11-19 07:53:51,395 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 153 transitions. Word has length 126 [2023-11-19 07:53:51,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:53:51,399 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 153 transitions. [2023-11-19 07:53:51,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-19 07:53:51,399 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 153 transitions. [2023-11-19 07:53:51,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-19 07:53:51,401 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:53:51,401 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:53:51,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:53:51,402 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:53:51,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:51,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1670491939, now seen corresponding path program 1 times [2023-11-19 07:53:51,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:51,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913126368] [2023-11-19 07:53:51,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:51,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:52,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:53:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:52,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:53:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:52,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:53:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:52,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:53:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:52,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:53:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:52,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:53:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:52,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:53:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:53,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:53:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:53,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:53:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:53,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:53:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:53,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:53:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:53,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:53:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:53,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:53:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:53,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:53:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:53,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:53:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:53,066 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-11-19 07:53:53,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:53,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913126368] [2023-11-19 07:53:53,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913126368] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:53:53,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084940269] [2023-11-19 07:53:53,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:53,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:53:53,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:53:53,070 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:53:53,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:53:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:53,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-19 07:53:53,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:53:53,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-19 07:53:53,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-19 07:53:53,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 63 [2023-11-19 07:53:53,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 32 [2023-11-19 07:53:53,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2023-11-19 07:53:53,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:53:53,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 70 [2023-11-19 07:53:54,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:53:54,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 278 treesize of output 146 [2023-11-19 07:53:54,350 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-11-19 07:53:54,351 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:53:54,806 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:53:54,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084940269] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-19 07:53:54,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:53:54,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12, 10] total 16 [2023-11-19 07:53:54,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729087134] [2023-11-19 07:53:54,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:53:54,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:53:54,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:53:54,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:53:54,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2023-11-19 07:53:54,810 INFO L87 Difference]: Start difference. First operand 117 states and 153 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:53:55,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:53:55,401 INFO L93 Difference]: Finished difference Result 343 states and 450 transitions. [2023-11-19 07:53:55,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:53:55,402 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2023-11-19 07:53:55,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:53:55,404 INFO L225 Difference]: With dead ends: 343 [2023-11-19 07:53:55,404 INFO L226 Difference]: Without dead ends: 229 [2023-11-19 07:53:55,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2023-11-19 07:53:55,405 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 173 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:53:55,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 748 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:53:55,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-11-19 07:53:55,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 218. [2023-11-19 07:53:55,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 187 states have (on average 1.2459893048128343) internal successors, (233), 188 states have internal predecessors, (233), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-19 07:53:55,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 285 transitions. [2023-11-19 07:53:55,446 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 285 transitions. Word has length 128 [2023-11-19 07:53:55,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:53:55,447 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 285 transitions. [2023-11-19 07:53:55,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:53:55,448 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 285 transitions. [2023-11-19 07:53:55,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-19 07:53:55,449 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:53:55,450 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:53:55,476 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:53:55,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:53:55,663 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:53:55,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:55,663 INFO L85 PathProgramCache]: Analyzing trace with hash -905662791, now seen corresponding path program 1 times [2023-11-19 07:53:55,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:55,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460596798] [2023-11-19 07:53:55,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:55,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:55,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:53:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:55,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:53:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:55,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:53:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:55,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:53:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:55,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:53:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:55,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:53:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:55,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:53:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:55,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:53:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:55,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:53:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:55,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:53:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:55,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:53:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:55,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:53:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:55,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:53:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:55,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:53:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:55,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:53:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:55,949 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:53:55,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:55,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460596798] [2023-11-19 07:53:55,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460596798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:53:55,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:53:55,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:53:55,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750598202] [2023-11-19 07:53:55,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:53:55,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:53:55,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:53:55,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:53:55,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:53:55,952 INFO L87 Difference]: Start difference. First operand 218 states and 285 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:53:56,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:53:56,258 INFO L93 Difference]: Finished difference Result 459 states and 601 transitions. [2023-11-19 07:53:56,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:53:56,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2023-11-19 07:53:56,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:53:56,264 INFO L225 Difference]: With dead ends: 459 [2023-11-19 07:53:56,264 INFO L226 Difference]: Without dead ends: 244 [2023-11-19 07:53:56,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:53:56,266 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 86 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:53:56,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 488 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:53:56,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-11-19 07:53:56,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 222. [2023-11-19 07:53:56,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 190 states have (on average 1.236842105263158) internal successors, (235), 191 states have internal predecessors, (235), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-19 07:53:56,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 287 transitions. [2023-11-19 07:53:56,311 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 287 transitions. Word has length 129 [2023-11-19 07:53:56,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:53:56,312 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 287 transitions. [2023-11-19 07:53:56,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:53:56,312 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 287 transitions. [2023-11-19 07:53:56,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-19 07:53:56,314 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:53:56,314 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:53:56,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:53:56,315 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:53:56,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:56,315 INFO L85 PathProgramCache]: Analyzing trace with hash 829750658, now seen corresponding path program 1 times [2023-11-19 07:53:56,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:56,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451910025] [2023-11-19 07:53:56,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:56,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:57,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:53:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:57,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:53:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:57,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:53:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:57,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:53:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:57,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:53:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:57,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:53:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:57,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:53:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:57,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:53:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:57,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:53:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:57,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:53:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:57,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:53:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:57,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:53:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:57,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:53:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:57,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:53:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:57,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:53:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:57,348 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:53:57,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:57,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451910025] [2023-11-19 07:53:57,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451910025] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:53:57,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:53:57,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 07:53:57,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734607058] [2023-11-19 07:53:57,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:53:57,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 07:53:57,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:53:57,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:53:57,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:53:57,354 INFO L87 Difference]: Start difference. First operand 222 states and 287 transitions. Second operand has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-19 07:53:58,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:53:58,410 INFO L93 Difference]: Finished difference Result 500 states and 655 transitions. [2023-11-19 07:53:58,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 07:53:58,411 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 130 [2023-11-19 07:53:58,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:53:58,415 INFO L225 Difference]: With dead ends: 500 [2023-11-19 07:53:58,415 INFO L226 Difference]: Without dead ends: 498 [2023-11-19 07:53:58,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-11-19 07:53:58,416 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 148 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-19 07:53:58,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 826 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-19 07:53:58,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2023-11-19 07:53:58,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 376. [2023-11-19 07:53:58,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 315 states have (on average 1.2095238095238094) internal successors, (381), 318 states have internal predecessors, (381), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-19 07:53:58,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 481 transitions. [2023-11-19 07:53:58,522 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 481 transitions. Word has length 130 [2023-11-19 07:53:58,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:53:58,522 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 481 transitions. [2023-11-19 07:53:58,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-19 07:53:58,523 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 481 transitions. [2023-11-19 07:53:58,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-19 07:53:58,525 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:53:58,525 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:53:58,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:53:58,526 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:53:58,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:58,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1060491747, now seen corresponding path program 1 times [2023-11-19 07:53:58,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:58,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537350662] [2023-11-19 07:53:58,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:58,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:58,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:53:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:58,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:53:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:58,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:53:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:58,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:53:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:58,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:53:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:58,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:53:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:58,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:53:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:58,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:53:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:58,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:53:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:58,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:53:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:58,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:53:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:58,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:53:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:58,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:53:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:58,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:53:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:58,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:53:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:58,851 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:53:58,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:58,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537350662] [2023-11-19 07:53:58,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537350662] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:53:58,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:53:58,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:53:58,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256498794] [2023-11-19 07:53:58,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:53:58,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:53:58,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:53:58,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:53:58,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:53:58,854 INFO L87 Difference]: Start difference. First operand 376 states and 481 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:53:59,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:53:59,177 INFO L93 Difference]: Finished difference Result 757 states and 965 transitions. [2023-11-19 07:53:59,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:53:59,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2023-11-19 07:53:59,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:53:59,181 INFO L225 Difference]: With dead ends: 757 [2023-11-19 07:53:59,181 INFO L226 Difference]: Without dead ends: 384 [2023-11-19 07:53:59,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:53:59,183 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 77 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:53:59,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 377 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:53:59,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2023-11-19 07:53:59,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 374. [2023-11-19 07:53:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 311 states have (on average 1.1961414790996785) internal successors, (372), 314 states have internal predecessors, (372), 50 states have call successors, (50), 12 states have call predecessors, (50), 12 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-19 07:53:59,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 472 transitions. [2023-11-19 07:53:59,268 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 472 transitions. Word has length 130 [2023-11-19 07:53:59,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:53:59,268 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 472 transitions. [2023-11-19 07:53:59,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:53:59,269 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 472 transitions. [2023-11-19 07:53:59,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-19 07:53:59,271 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:53:59,271 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:53:59,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 07:53:59,272 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:53:59,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:59,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1621895359, now seen corresponding path program 1 times [2023-11-19 07:53:59,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:59,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101380148] [2023-11-19 07:53:59,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:59,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:53:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:53:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:53:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:53:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:53:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:53:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:53:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:53:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:53:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:53:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:53:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:53:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:53:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:53:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:53:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,562 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:53:59,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:59,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101380148] [2023-11-19 07:53:59,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101380148] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:53:59,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:53:59,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:53:59,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606016041] [2023-11-19 07:53:59,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:53:59,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:53:59,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:53:59,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:53:59,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:53:59,566 INFO L87 Difference]: Start difference. First operand 374 states and 472 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:54:00,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:00,063 INFO L93 Difference]: Finished difference Result 937 states and 1188 transitions. [2023-11-19 07:54:00,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:54:00,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2023-11-19 07:54:00,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:00,075 INFO L225 Difference]: With dead ends: 937 [2023-11-19 07:54:00,075 INFO L226 Difference]: Without dead ends: 566 [2023-11-19 07:54:00,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:54:00,077 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 169 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:00,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 457 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:54:00,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2023-11-19 07:54:00,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 377. [2023-11-19 07:54:00,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 314 states have (on average 1.1910828025477707) internal successors, (374), 317 states have internal predecessors, (374), 50 states have call successors, (50), 12 states have call predecessors, (50), 12 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-19 07:54:00,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 474 transitions. [2023-11-19 07:54:00,180 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 474 transitions. Word has length 131 [2023-11-19 07:54:00,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:00,181 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 474 transitions. [2023-11-19 07:54:00,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:54:00,181 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 474 transitions. [2023-11-19 07:54:00,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-19 07:54:00,184 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:00,184 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:54:00,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 07:54:00,185 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:00,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:00,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1228868349, now seen corresponding path program 1 times [2023-11-19 07:54:00,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:00,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170935195] [2023-11-19 07:54:00,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:00,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:54:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:54:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:54:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:54:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:54:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:54:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:54:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:54:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:54:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:54:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:54:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,418 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:54:00,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:00,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170935195] [2023-11-19 07:54:00,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170935195] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:00,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:00,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:54:00,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928364519] [2023-11-19 07:54:00,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:00,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:54:00,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:00,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:54:00,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:54:00,422 INFO L87 Difference]: Start difference. First operand 377 states and 474 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:54:00,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:00,578 INFO L93 Difference]: Finished difference Result 764 states and 963 transitions. [2023-11-19 07:54:00,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:54:00,579 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2023-11-19 07:54:00,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:00,582 INFO L225 Difference]: With dead ends: 764 [2023-11-19 07:54:00,582 INFO L226 Difference]: Without dead ends: 390 [2023-11-19 07:54:00,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:54:00,584 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 76 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:00,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 734 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:54:00,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2023-11-19 07:54:00,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 382. [2023-11-19 07:54:00,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 319 states have (on average 1.1849529780564263) internal successors, (378), 322 states have internal predecessors, (378), 50 states have call successors, (50), 12 states have call predecessors, (50), 12 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-19 07:54:00,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 478 transitions. [2023-11-19 07:54:00,667 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 478 transitions. Word has length 131 [2023-11-19 07:54:00,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:00,667 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 478 transitions. [2023-11-19 07:54:00,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:54:00,668 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 478 transitions. [2023-11-19 07:54:00,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-19 07:54:00,670 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:00,670 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:54:00,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-19 07:54:00,671 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:00,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:00,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1323025862, now seen corresponding path program 1 times [2023-11-19 07:54:00,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:00,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873059645] [2023-11-19 07:54:00,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:00,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:54:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:54:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:54:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:54:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:54:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:54:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:54:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:54:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:54:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:54:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:54:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,918 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:54:00,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:00,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873059645] [2023-11-19 07:54:00,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873059645] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:00,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:00,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:54:00,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292374781] [2023-11-19 07:54:00,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:00,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:54:00,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:00,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:54:00,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:54:00,923 INFO L87 Difference]: Start difference. First operand 382 states and 478 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:54:01,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:01,337 INFO L93 Difference]: Finished difference Result 798 states and 997 transitions. [2023-11-19 07:54:01,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:54:01,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2023-11-19 07:54:01,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:01,342 INFO L225 Difference]: With dead ends: 798 [2023-11-19 07:54:01,342 INFO L226 Difference]: Without dead ends: 419 [2023-11-19 07:54:01,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:54:01,344 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 88 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:01,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 453 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:54:01,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-11-19 07:54:01,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 414. [2023-11-19 07:54:01,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 332 states have (on average 1.1626506024096386) internal successors, (386), 336 states have internal predecessors, (386), 65 states have call successors, (65), 16 states have call predecessors, (65), 16 states have return successors, (65), 61 states have call predecessors, (65), 65 states have call successors, (65) [2023-11-19 07:54:01,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 516 transitions. [2023-11-19 07:54:01,452 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 516 transitions. Word has length 132 [2023-11-19 07:54:01,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:01,454 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 516 transitions. [2023-11-19 07:54:01,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:54:01,455 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 516 transitions. [2023-11-19 07:54:01,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-19 07:54:01,457 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:01,458 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:54:01,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-19 07:54:01,458 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:01,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:01,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1667785729, now seen corresponding path program 1 times [2023-11-19 07:54:01,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:01,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620048994] [2023-11-19 07:54:01,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:01,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:02,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:02,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:02,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:02,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:02,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:54:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:02,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:54:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:02,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:54:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:02,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:54:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:02,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:54:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:02,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:54:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:02,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:54:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:02,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:54:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:02,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:54:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:02,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:54:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:02,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:54:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:02,472 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-11-19 07:54:02,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:02,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620048994] [2023-11-19 07:54:02,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620048994] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:54:02,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416283589] [2023-11-19 07:54:02,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:02,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:54:02,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:54:02,474 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:54:02,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:54:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:02,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-19 07:54:02,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:54:02,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2023-11-19 07:54:02,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2023-11-19 07:54:02,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2023-11-19 07:54:02,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2023-11-19 07:54:02,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2023-11-19 07:54:02,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2023-11-19 07:54:02,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 79 [2023-11-19 07:54:03,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:54:03,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 99 [2023-11-19 07:54:03,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:54:03,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:54:03,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 26 [2023-11-19 07:54:03,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:54:03,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 75 [2023-11-19 07:54:03,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:54:03,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 65 [2023-11-19 07:54:03,391 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 174 proven. 66 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-19 07:54:03,391 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:54:03,748 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-11-19 07:54:03,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416283589] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:54:03,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:54:03,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 15 [2023-11-19 07:54:03,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726030099] [2023-11-19 07:54:03,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:54:03,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-19 07:54:03,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:03,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-19 07:54:03,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2023-11-19 07:54:03,753 INFO L87 Difference]: Start difference. First operand 414 states and 516 transitions. Second operand has 15 states, 12 states have (on average 8.666666666666666) internal successors, (104), 15 states have internal predecessors, (104), 6 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 3 states have call predecessors, (32), 6 states have call successors, (32) [2023-11-19 07:54:05,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:05,299 INFO L93 Difference]: Finished difference Result 624 states and 761 transitions. [2023-11-19 07:54:05,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-19 07:54:05,300 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 8.666666666666666) internal successors, (104), 15 states have internal predecessors, (104), 6 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 3 states have call predecessors, (32), 6 states have call successors, (32) Word has length 132 [2023-11-19 07:54:05,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:05,301 INFO L225 Difference]: With dead ends: 624 [2023-11-19 07:54:05,302 INFO L226 Difference]: Without dead ends: 259 [2023-11-19 07:54:05,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 285 SyntacticMatches, 11 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=340, Invalid=1142, Unknown=0, NotChecked=0, Total=1482 [2023-11-19 07:54:05,304 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 441 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:05,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 382 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-19 07:54:05,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2023-11-19 07:54:05,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 190. [2023-11-19 07:54:05,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 154 states have (on average 1.1168831168831168) internal successors, (172), 155 states have internal predecessors, (172), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-19 07:54:05,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 224 transitions. [2023-11-19 07:54:05,361 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 224 transitions. Word has length 132 [2023-11-19 07:54:05,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:05,362 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 224 transitions. [2023-11-19 07:54:05,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 8.666666666666666) internal successors, (104), 15 states have internal predecessors, (104), 6 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 3 states have call predecessors, (32), 6 states have call successors, (32) [2023-11-19 07:54:05,362 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 224 transitions. [2023-11-19 07:54:05,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-19 07:54:05,364 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:05,364 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:54:05,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:54:05,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:54:05,581 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:05,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:05,581 INFO L85 PathProgramCache]: Analyzing trace with hash -953934379, now seen corresponding path program 1 times [2023-11-19 07:54:05,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:05,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733712162] [2023-11-19 07:54:05,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:05,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:05,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:05,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:05,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:05,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:05,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:54:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:05,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:54:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:05,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:54:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:05,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:54:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:05,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:54:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:05,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:54:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:05,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:54:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:05,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:54:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:05,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:54:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:05,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:54:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:05,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:54:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:05,885 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-19 07:54:05,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:05,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733712162] [2023-11-19 07:54:05,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733712162] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:05,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:05,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:54:05,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662613475] [2023-11-19 07:54:05,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:05,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:54:05,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:05,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:54:05,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:54:05,891 INFO L87 Difference]: Start difference. First operand 190 states and 224 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:54:06,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:06,128 INFO L93 Difference]: Finished difference Result 418 states and 492 transitions. [2023-11-19 07:54:06,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:54:06,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2023-11-19 07:54:06,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:06,129 INFO L225 Difference]: With dead ends: 418 [2023-11-19 07:54:06,129 INFO L226 Difference]: Without dead ends: 0 [2023-11-19 07:54:06,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:54:06,132 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 63 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:06,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 351 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:54:06,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-19 07:54:06,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-19 07:54:06,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2023-11-19 07:54:06,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-19 07:54:06,133 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 133 [2023-11-19 07:54:06,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:06,134 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-19 07:54:06,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-19 07:54:06,134 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-19 07:54:06,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-19 07:54:06,138 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 07:54:06,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-19 07:54:06,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-19 07:54:15,403 INFO L899 garLoopResultBuilder]: For program point L117-21(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,403 INFO L899 garLoopResultBuilder]: For program point L117-23(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,403 INFO L899 garLoopResultBuilder]: For program point L117-25(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,404 INFO L899 garLoopResultBuilder]: For program point L117-26(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,404 INFO L899 garLoopResultBuilder]: For program point L117-27(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,404 INFO L899 garLoopResultBuilder]: For program point L117-29(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,404 INFO L899 garLoopResultBuilder]: For program point L117-30(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,404 INFO L899 garLoopResultBuilder]: For program point L117-31(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,404 INFO L899 garLoopResultBuilder]: For program point L117-32(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,404 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 53) no Hoare annotation was computed. [2023-11-19 07:54:15,404 INFO L899 garLoopResultBuilder]: For program point L117-34(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,404 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-19 07:54:15,405 INFO L899 garLoopResultBuilder]: For program point L117-35(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,405 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-19 07:54:15,405 INFO L899 garLoopResultBuilder]: For program point L117-37(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,405 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-19 07:54:15,405 INFO L899 garLoopResultBuilder]: For program point L117-39(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,405 INFO L899 garLoopResultBuilder]: For program point L117-41(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,406 INFO L899 garLoopResultBuilder]: For program point L117-43(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,406 INFO L895 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: (let ((.cse4 (select |#memory_int| |~#WrapperStruct00~0.base|))) (let ((.cse2 (select .cse4 28))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select .cse4 27))) (and (<= (+ .cse0 .cse1) (+ (* (div .cse1 256) 256) .cse2)) (let ((.cse3 (select .cse4 6))) (<= .cse3 (* (div .cse3 256) 256))) (= |~#WrapperStruct00~0.offset| 0) (= (select .cse4 23) ~last_1_WrapperStruct00_var_1_8~0) (<= .cse1 (+ .cse0 255 (* 256 (div (+ .cse1 (* (- 1) .cse2)) 256)))))))) [2023-11-19 07:54:15,406 INFO L899 garLoopResultBuilder]: For program point L102-1(line 102) no Hoare annotation was computed. [2023-11-19 07:54:15,406 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 87) no Hoare annotation was computed. [2023-11-19 07:54:15,407 INFO L895 garLoopResultBuilder]: At program point L104(line 104) the Hoare annotation is: (let ((.cse4 (select |#memory_int| |~#WrapperStruct00~0.base|))) (let ((.cse2 (select .cse4 28))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select .cse4 27))) (and (<= (+ .cse0 .cse1) (+ (* (div .cse1 256) 256) .cse2)) (let ((.cse3 (select .cse4 6))) (<= .cse3 (* (div .cse3 256) 256))) (= |~#WrapperStruct00~0.offset| 0) (= (select .cse4 23) ~last_1_WrapperStruct00_var_1_8~0) (<= .cse1 (+ .cse0 255 (* 256 (div (+ .cse1 (* (- 1) .cse2)) 256)))))))) [2023-11-19 07:54:15,407 INFO L899 garLoopResultBuilder]: For program point L104-1(line 104) no Hoare annotation was computed. [2023-11-19 07:54:15,407 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 112) no Hoare annotation was computed. [2023-11-19 07:54:15,407 INFO L895 garLoopResultBuilder]: At program point L105(line 105) the Hoare annotation is: (let ((.cse4 (select |#memory_int| |~#WrapperStruct00~0.base|))) (let ((.cse2 (select .cse4 28))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select .cse4 27))) (and (<= (+ .cse0 .cse1) (+ (* (div .cse1 256) 256) .cse2)) (let ((.cse3 (select .cse4 6))) (<= .cse3 (* (div .cse3 256) 256))) (= |~#WrapperStruct00~0.offset| 0) (= (select .cse4 23) ~last_1_WrapperStruct00_var_1_8~0) (<= .cse1 (+ .cse0 255 (* 256 (div (+ .cse1 (* (- 1) .cse2)) 256)))))))) [2023-11-19 07:54:15,407 INFO L899 garLoopResultBuilder]: For program point L105-1(line 105) no Hoare annotation was computed. [2023-11-19 07:54:15,408 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 60) no Hoare annotation was computed. [2023-11-19 07:54:15,408 INFO L899 garLoopResultBuilder]: For program point L56-2(lines 56 60) no Hoare annotation was computed. [2023-11-19 07:54:15,408 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 77) no Hoare annotation was computed. [2023-11-19 07:54:15,408 INFO L899 garLoopResultBuilder]: For program point L73-1(lines 73 77) no Hoare annotation was computed. [2023-11-19 07:54:15,409 INFO L895 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (let ((.cse1 (select |#memory_int| |~#WrapperStruct00~0.base|))) (let ((.cse11 (select .cse1 28))) (let ((.cse7 (select .cse1 23)) (.cse10 (* 256 (div .cse11 256))) (.cse9 (select .cse1 27))) (let ((.cse0 (<= (+ .cse10 .cse9) (+ (* (div .cse9 256) 256) .cse11))) (.cse2 (let ((.cse12 (select .cse1 6))) (<= .cse12 (* (div .cse12 256) 256)))) (.cse3 (= |~#WrapperStruct00~0.offset| 0)) (.cse4 (= .cse7 ~last_1_WrapperStruct00_var_1_8~0)) (.cse5 (<= .cse9 (+ .cse10 255 (* 256 (div (+ .cse9 (* (- 1) .cse11)) 256)))))) (or (and .cse0 (not (= (select .cse1 25) (select .cse1 2))) .cse2 .cse3 .cse4 .cse5) (and (let ((.cse6 (mod (+ 240 (select .cse1 26)) 256))) (or (and (<= 128 .cse6) (= .cse6 (+ 256 .cse7))) (and (<= .cse6 127) (= .cse6 .cse7)))) (let ((.cse8 (select .cse1 0))) (<= .cse8 (* (div .cse8 256) 256))) .cse0 .cse2 .cse3 .cse4 .cse5)))))) [2023-11-19 07:54:15,409 INFO L899 garLoopResultBuilder]: For program point L90-1(line 90) no Hoare annotation was computed. [2023-11-19 07:54:15,409 INFO L895 garLoopResultBuilder]: At program point L123-2(lines 123 129) the Hoare annotation is: (let ((.cse1 (select |#memory_int| |~#WrapperStruct00~0.base|))) (let ((.cse10 (select .cse1 28))) (let ((.cse9 (* 256 (div .cse10 256))) (.cse8 (select .cse1 27))) (let ((.cse5 (<= (+ .cse9 .cse8) (+ (* (div .cse8 256) 256) .cse10))) (.cse4 (let ((.cse11 (select .cse1 6))) (<= .cse11 (* (div .cse11 256) 256)))) (.cse6 (= |~#WrapperStruct00~0.offset| 0)) (.cse7 (<= .cse8 (+ .cse9 255 (* 256 (div (+ .cse8 (* (- 1) .cse10)) 256)))))) (or (and (let ((.cse0 (select .cse1 0))) (<= .cse0 (* (div .cse0 256) 256))) (let ((.cse2 (mod (+ 240 (select .cse1 26)) 256)) (.cse3 (select .cse1 23))) (or (and (<= 128 .cse2) (= .cse2 (+ 256 .cse3)) .cse4) (and (<= .cse2 127) (= .cse2 .cse3) .cse4))) .cse5 .cse6 .cse7) (and .cse5 (not (= (select .cse1 25) (select .cse1 2))) .cse4 .cse6 .cse7)))))) [2023-11-19 07:54:15,409 INFO L899 garLoopResultBuilder]: For program point L123-3(lines 123 129) no Hoare annotation was computed. [2023-11-19 07:54:15,410 INFO L899 garLoopResultBuilder]: For program point property_returnLabel#1(lines 116 119) no Hoare annotation was computed. [2023-11-19 07:54:15,410 INFO L895 garLoopResultBuilder]: At program point L107(line 107) the Hoare annotation is: (let ((.cse4 (select |#memory_int| |~#WrapperStruct00~0.base|))) (let ((.cse2 (select .cse4 28))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select .cse4 27))) (and (<= (+ .cse0 .cse1) (+ (* (div .cse1 256) 256) .cse2)) (let ((.cse3 (select .cse4 6))) (<= .cse3 (* (div .cse3 256) 256))) (= |~#WrapperStruct00~0.offset| 0) (= (select .cse4 23) ~last_1_WrapperStruct00_var_1_8~0) (<= .cse1 (+ .cse0 255 (* 256 (div (+ .cse1 (* (- 1) .cse2)) 256)))))))) [2023-11-19 07:54:15,410 INFO L899 garLoopResultBuilder]: For program point L107-1(line 107) no Hoare annotation was computed. [2023-11-19 07:54:15,410 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 76) no Hoare annotation was computed. [2023-11-19 07:54:15,410 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-19 07:54:15,411 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (let ((.cse1 (select |#memory_int| |~#WrapperStruct00~0.base|))) (let ((.cse11 (select .cse1 28))) (let ((.cse7 (select .cse1 23)) (.cse10 (* 256 (div .cse11 256))) (.cse9 (select .cse1 27))) (let ((.cse0 (<= (+ .cse10 .cse9) (+ (* (div .cse9 256) 256) .cse11))) (.cse2 (let ((.cse12 (select .cse1 6))) (<= .cse12 (* (div .cse12 256) 256)))) (.cse3 (= |~#WrapperStruct00~0.offset| 0)) (.cse4 (= .cse7 ~last_1_WrapperStruct00_var_1_8~0)) (.cse5 (<= .cse9 (+ .cse10 255 (* 256 (div (+ .cse9 (* (- 1) .cse11)) 256)))))) (or (and .cse0 (not (= (select .cse1 25) (select .cse1 2))) .cse2 .cse3 .cse4 .cse5) (and (let ((.cse6 (mod (+ 240 (select .cse1 26)) 256))) (or (and (<= 128 .cse6) (= .cse6 (+ 256 .cse7))) (and (<= .cse6 127) (= .cse6 .cse7)))) (let ((.cse8 (select .cse1 0))) (<= .cse8 (* (div .cse8 256) 256))) .cse0 .cse2 .cse3 .cse4 .cse5)))))) [2023-11-19 07:54:15,411 INFO L899 garLoopResultBuilder]: For program point L91-1(line 91) no Hoare annotation was computed. [2023-11-19 07:54:15,411 INFO L895 garLoopResultBuilder]: At program point L108(line 108) the Hoare annotation is: (let ((.cse4 (select |#memory_int| |~#WrapperStruct00~0.base|))) (let ((.cse2 (select .cse4 28))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select .cse4 27))) (and (<= (+ .cse0 .cse1) (+ (* (div .cse1 256) 256) .cse2)) (let ((.cse3 (select .cse4 6))) (<= .cse3 (* (div .cse3 256) 256))) (= |~#WrapperStruct00~0.offset| 0) (= (select .cse4 23) ~last_1_WrapperStruct00_var_1_8~0) (<= .cse1 (+ .cse0 255 (* 256 (div (+ .cse1 (* (- 1) .cse2)) 256)))))))) [2023-11-19 07:54:15,412 INFO L899 garLoopResultBuilder]: For program point L108-1(line 108) no Hoare annotation was computed. [2023-11-19 07:54:15,412 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-11-19 07:54:15,412 INFO L899 garLoopResultBuilder]: For program point L75-2(line 75) no Hoare annotation was computed. [2023-11-19 07:54:15,412 INFO L895 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: (let ((.cse4 (select |#memory_int| |~#WrapperStruct00~0.base|))) (let ((.cse2 (select .cse4 28))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select .cse4 27))) (and (<= (+ .cse0 .cse1) (+ (* (div .cse1 256) 256) .cse2)) (let ((.cse3 (select .cse4 6))) (<= .cse3 (* (div .cse3 256) 256))) (= |~#WrapperStruct00~0.offset| 0) (= (select .cse4 23) ~last_1_WrapperStruct00_var_1_8~0) (<= .cse1 (+ .cse0 255 (* 256 (div (+ .cse1 (* (- 1) .cse2)) 256)))))))) [2023-11-19 07:54:15,412 INFO L899 garLoopResultBuilder]: For program point L93-1(line 93) no Hoare annotation was computed. [2023-11-19 07:54:15,413 INFO L895 garLoopResultBuilder]: At program point L110(line 110) the Hoare annotation is: (let ((.cse1 (select |#memory_int| |~#WrapperStruct00~0.base|))) (and (let ((.cse0 (select .cse1 6))) (<= .cse0 (* (div .cse0 256) 256))) (= |~#WrapperStruct00~0.offset| 0) (= |ULTIMATE.start_updateVariables_#t~mem59#1| (select .cse1 28)) (= (select .cse1 23) ~last_1_WrapperStruct00_var_1_8~0))) [2023-11-19 07:54:15,413 INFO L899 garLoopResultBuilder]: For program point L110-1(line 110) no Hoare annotation was computed. [2023-11-19 07:54:15,413 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 120 131) no Hoare annotation was computed. [2023-11-19 07:54:15,413 INFO L895 garLoopResultBuilder]: At program point L94(line 94) the Hoare annotation is: (let ((.cse4 (select |#memory_int| |~#WrapperStruct00~0.base|))) (let ((.cse2 (select .cse4 28))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select .cse4 27))) (and (<= (+ .cse0 .cse1) (+ (* (div .cse1 256) 256) .cse2)) (let ((.cse3 (select .cse4 6))) (<= .cse3 (* (div .cse3 256) 256))) (= |~#WrapperStruct00~0.offset| 0) (= (select .cse4 23) ~last_1_WrapperStruct00_var_1_8~0) (<= .cse1 (+ .cse0 255 (* 256 (div (+ .cse1 (* (- 1) .cse2)) 256)))))))) [2023-11-19 07:54:15,413 INFO L899 garLoopResultBuilder]: For program point L94-1(line 94) no Hoare annotation was computed. [2023-11-19 07:54:15,414 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 71) no Hoare annotation was computed. [2023-11-19 07:54:15,414 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-19 07:54:15,414 INFO L895 garLoopResultBuilder]: At program point L111(line 111) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |~#WrapperStruct00~0.base|))) (and (= |ULTIMATE.start_updateVariables_#t~mem60#1| (select .cse0 28)) (let ((.cse1 (select .cse0 6))) (<= .cse1 (* (div .cse1 256) 256))) (= |~#WrapperStruct00~0.offset| 0) (= (select .cse0 23) ~last_1_WrapperStruct00_var_1_8~0))) [2023-11-19 07:54:15,414 INFO L899 garLoopResultBuilder]: For program point L111-1(line 111) no Hoare annotation was computed. [2023-11-19 07:54:15,414 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 86) no Hoare annotation was computed. [2023-11-19 07:54:15,415 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2023-11-19 07:54:15,415 INFO L899 garLoopResultBuilder]: For program point L62-2(line 62) no Hoare annotation was computed. [2023-11-19 07:54:15,415 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-11-19 07:54:15,415 INFO L899 garLoopResultBuilder]: For program point L79-2(lines 79 83) no Hoare annotation was computed. [2023-11-19 07:54:15,416 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-19 07:54:15,416 INFO L895 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: (let ((.cse3 (select |#memory_int| |~#WrapperStruct00~0.base|))) (let ((.cse2 (select .cse3 28))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select .cse3 27))) (and (<= (+ .cse0 .cse1) (+ (* (div .cse1 256) 256) .cse2)) (= |~#WrapperStruct00~0.offset| 0) (= (select .cse3 23) ~last_1_WrapperStruct00_var_1_8~0) (<= .cse1 (+ .cse0 255 (* 256 (div (+ .cse1 (* (- 1) .cse2)) 256)))))))) [2023-11-19 07:54:15,416 INFO L899 garLoopResultBuilder]: For program point L96-1(line 96) no Hoare annotation was computed. [2023-11-19 07:54:15,416 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 115) no Hoare annotation was computed. [2023-11-19 07:54:15,416 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-11-19 07:54:15,416 INFO L899 garLoopResultBuilder]: For program point L80-2(line 80) no Hoare annotation was computed. [2023-11-19 07:54:15,417 INFO L895 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |~#WrapperStruct00~0.base|))) (let ((.cse3 (select .cse0 28))) (let ((.cse1 (* 256 (div .cse3 256))) (.cse2 (select .cse0 27))) (and (= |ULTIMATE.start_updateVariables_#t~mem40#1| (select .cse0 6)) (<= (+ .cse1 .cse2) (+ (* (div .cse2 256) 256) .cse3)) (= |~#WrapperStruct00~0.offset| 0) (= (select .cse0 23) ~last_1_WrapperStruct00_var_1_8~0) (<= .cse2 (+ .cse1 255 (* 256 (div (+ .cse2 (* (- 1) .cse3)) 256)))))))) [2023-11-19 07:54:15,417 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2023-11-19 07:54:15,417 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 70) no Hoare annotation was computed. [2023-11-19 07:54:15,417 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-19 07:54:15,417 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-19 07:54:15,418 INFO L899 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2023-11-19 07:54:15,418 INFO L899 garLoopResultBuilder]: For program point L99-2(line 99) no Hoare annotation was computed. [2023-11-19 07:54:15,418 INFO L899 garLoopResultBuilder]: For program point L99-3(line 99) no Hoare annotation was computed. [2023-11-19 07:54:15,418 INFO L899 garLoopResultBuilder]: For program point L99-5(line 99) no Hoare annotation was computed. [2023-11-19 07:54:15,418 INFO L899 garLoopResultBuilder]: For program point L99-7(line 99) no Hoare annotation was computed. [2023-11-19 07:54:15,418 INFO L895 garLoopResultBuilder]: At program point L99-8(line 99) the Hoare annotation is: (let ((.cse4 (select |#memory_int| |~#WrapperStruct00~0.base|))) (let ((.cse2 (select .cse4 28))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select .cse4 27))) (and (<= (+ .cse0 .cse1) (+ (* (div .cse1 256) 256) .cse2)) (let ((.cse3 (select .cse4 6))) (<= .cse3 (* (div .cse3 256) 256))) (= |~#WrapperStruct00~0.offset| 0) (= (select .cse4 23) ~last_1_WrapperStruct00_var_1_8~0) (<= .cse1 (+ .cse0 255 (* 256 (div (+ .cse1 (* (- 1) .cse2)) 256)))))))) [2023-11-19 07:54:15,419 INFO L899 garLoopResultBuilder]: For program point L99-9(line 99) no Hoare annotation was computed. [2023-11-19 07:54:15,419 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 69) no Hoare annotation was computed. [2023-11-19 07:54:15,419 INFO L899 garLoopResultBuilder]: For program point L67-2(lines 61 71) no Hoare annotation was computed. [2023-11-19 07:54:15,419 INFO L899 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,420 INFO L899 garLoopResultBuilder]: For program point L117-2(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,420 INFO L899 garLoopResultBuilder]: For program point L117-3(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,420 INFO L899 garLoopResultBuilder]: For program point L117-4(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,420 INFO L899 garLoopResultBuilder]: For program point L117-5(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,420 INFO L899 garLoopResultBuilder]: For program point L117-6(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,420 INFO L899 garLoopResultBuilder]: For program point L117-8(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,420 INFO L899 garLoopResultBuilder]: For program point L117-10(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,421 INFO L899 garLoopResultBuilder]: For program point L117-12(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,421 INFO L899 garLoopResultBuilder]: For program point L117-14(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,421 INFO L899 garLoopResultBuilder]: For program point L117-15(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,421 INFO L895 garLoopResultBuilder]: At program point L101(line 101) the Hoare annotation is: (let ((.cse4 (select |#memory_int| |~#WrapperStruct00~0.base|))) (let ((.cse2 (select .cse4 28))) (let ((.cse0 (* 256 (div .cse2 256))) (.cse1 (select .cse4 27))) (and (<= (+ .cse0 .cse1) (+ (* (div .cse1 256) 256) .cse2)) (let ((.cse3 (select .cse4 6))) (<= .cse3 (* (div .cse3 256) 256))) (= |~#WrapperStruct00~0.offset| 0) (= (select .cse4 23) ~last_1_WrapperStruct00_var_1_8~0) (<= .cse1 (+ .cse0 255 (* 256 (div (+ .cse1 (* (- 1) .cse2)) 256)))))))) [2023-11-19 07:54:15,421 INFO L899 garLoopResultBuilder]: For program point L117-16(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,422 INFO L899 garLoopResultBuilder]: For program point L101-1(line 101) no Hoare annotation was computed. [2023-11-19 07:54:15,422 INFO L899 garLoopResultBuilder]: For program point L117-17(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,422 INFO L899 garLoopResultBuilder]: For program point L117-19(line 117) no Hoare annotation was computed. [2023-11-19 07:54:15,422 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-19 07:54:15,422 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-19 07:54:15,422 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-19 07:54:15,422 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-19 07:54:15,426 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:54:15,428 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:54:15,440 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][0] could not be translated [2023-11-19 07:54:15,441 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][0] could not be translated [2023-11-19 07:54:15,443 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][26] could not be translated [2023-11-19 07:54:15,444 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][26] could not be translated [2023-11-19 07:54:15,444 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][23] could not be translated [2023-11-19 07:54:15,444 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][6] could not be translated [2023-11-19 07:54:15,444 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][6] could not be translated [2023-11-19 07:54:15,445 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][26] could not be translated [2023-11-19 07:54:15,445 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][26] could not be translated [2023-11-19 07:54:15,445 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][23] could not be translated [2023-11-19 07:54:15,445 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][6] could not be translated [2023-11-19 07:54:15,445 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][6] could not be translated [2023-11-19 07:54:15,446 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][28] could not be translated [2023-11-19 07:54:15,446 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][27] could not be translated [2023-11-19 07:54:15,446 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][27] could not be translated [2023-11-19 07:54:15,446 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][28] could not be translated [2023-11-19 07:54:15,447 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][27] could not be translated [2023-11-19 07:54:15,447 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][28] could not be translated [2023-11-19 07:54:15,447 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][27] could not be translated [2023-11-19 07:54:15,447 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][28] could not be translated [2023-11-19 07:54:15,447 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][28] could not be translated [2023-11-19 07:54:15,448 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][27] could not be translated [2023-11-19 07:54:15,448 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][27] could not be translated [2023-11-19 07:54:15,448 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][28] could not be translated [2023-11-19 07:54:15,448 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][25] could not be translated [2023-11-19 07:54:15,448 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][2] could not be translated [2023-11-19 07:54:15,449 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][6] could not be translated [2023-11-19 07:54:15,449 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][6] could not be translated [2023-11-19 07:54:15,449 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][27] could not be translated [2023-11-19 07:54:15,449 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][28] could not be translated [2023-11-19 07:54:15,450 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][27] could not be translated [2023-11-19 07:54:15,450 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][28] could not be translated [2023-11-19 07:54:15,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:54:15 BoogieIcfgContainer [2023-11-19 07:54:15,451 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:54:15,451 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:54:15,451 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:54:15,452 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:54:15,452 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:53:38" (3/4) ... [2023-11-19 07:54:15,454 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-19 07:54:15,458 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-19 07:54:15,467 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-19 07:54:15,469 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-19 07:54:15,469 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-19 07:54:15,470 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-19 07:54:15,611 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:54:15,612 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu/witness.yml [2023-11-19 07:54:15,612 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:54:15,615 INFO L158 Benchmark]: Toolchain (without parser) took 38868.80ms. Allocated memory was 161.5MB in the beginning and 599.8MB in the end (delta: 438.3MB). Free memory was 122.1MB in the beginning and 502.9MB in the end (delta: -380.8MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. [2023-11-19 07:54:15,615 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 68.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:54:15,620 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.32ms. Allocated memory is still 161.5MB. Free memory was 121.8MB in the beginning and 106.8MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-19 07:54:15,620 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.72ms. Allocated memory is still 161.5MB. Free memory was 106.8MB in the beginning and 103.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 07:54:15,621 INFO L158 Benchmark]: Boogie Preprocessor took 97.30ms. Allocated memory is still 161.5MB. Free memory was 103.3MB in the beginning and 100.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:54:15,621 INFO L158 Benchmark]: RCFGBuilder took 831.02ms. Allocated memory is still 161.5MB. Free memory was 100.5MB in the beginning and 124.9MB in the end (delta: -24.4MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2023-11-19 07:54:15,622 INFO L158 Benchmark]: TraceAbstraction took 37326.85ms. Allocated memory was 161.5MB in the beginning and 599.8MB in the end (delta: 438.3MB). Free memory was 124.0MB in the beginning and 512.4MB in the end (delta: -388.4MB). Peak memory consumption was 357.9MB. Max. memory is 16.1GB. [2023-11-19 07:54:15,623 INFO L158 Benchmark]: Witness Printer took 160.78ms. Allocated memory is still 599.8MB. Free memory was 512.4MB in the beginning and 502.9MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-19 07:54:15,629 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 68.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 350.32ms. Allocated memory is still 161.5MB. Free memory was 121.8MB in the beginning and 106.8MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.72ms. Allocated memory is still 161.5MB. Free memory was 106.8MB in the beginning and 103.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.30ms. Allocated memory is still 161.5MB. Free memory was 103.3MB in the beginning and 100.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 831.02ms. Allocated memory is still 161.5MB. Free memory was 100.5MB in the beginning and 124.9MB in the end (delta: -24.4MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. * TraceAbstraction took 37326.85ms. Allocated memory was 161.5MB in the beginning and 599.8MB in the end (delta: 438.3MB). Free memory was 124.0MB in the beginning and 512.4MB in the end (delta: -388.4MB). Peak memory consumption was 357.9MB. Max. memory is 16.1GB. * Witness Printer took 160.78ms. Allocated memory is still 599.8MB. Free memory was 512.4MB in the beginning and 502.9MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][26] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][26] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][23] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][6] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][6] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][26] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][26] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][23] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][6] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][6] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][28] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][27] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][27] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][28] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][27] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][28] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][27] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][28] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][28] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][27] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][27] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][28] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][25] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][6] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][6] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][27] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][28] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][27] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#WrapperStruct00~0!base][28] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.2s, OverallIterations: 21, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2284 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2275 mSDsluCounter, 9496 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6689 mSDsCounter, 265 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4887 IncrementalHoareTripleChecker+Invalid, 5152 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 265 mSolverCounterUnsat, 2807 mSDtfsCounter, 4887 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1418 GetRequests, 1254 SyntacticMatches, 12 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=414occurred in iteration=19, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 806 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 556 PreInvPairs, 600 NumberOfFragments, 1847 HoareAnnotationTreeSize, 556 FomulaSimplifications, 388694 FormulaSimplificationTreeSizeReduction, 6.2s HoareSimplificationTime, 17 FomulaSimplificationsInter, 87722 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 16.0s InterpolantComputationTime, 2901 NumberOfCodeBlocks, 2901 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3136 ConstructedInterpolants, 0 QuantifiedInterpolants, 14623 SizeOfPredicates, 24 NumberOfNonLiveVariables, 828 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 25 InterpolantComputations, 20 PerfectInterpolantSequences, 10329/10500 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-11-19 07:54:15,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbf8d1ee-49f2-4f6c-a5d9-8ee9a34031e2/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE