./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.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_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/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_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/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_a3d5f486-923a-45df-a847-c5148169616f/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 85aa73e9da404b3237f6b534f76a96725f8c968f66c8526708e2a81ace8745de --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:33:41,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:33:41,794 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:33:41,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:33:41,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:33:41,828 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:33:41,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:33:41,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:33:41,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:33:41,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:33:41,839 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:33:41,840 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:33:41,840 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:33:41,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:33:41,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:33:41,843 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:33:41,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:33:41,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:33:41,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:33:41,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:33:41,846 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:33:41,847 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:33:41,847 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:33:41,849 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:33:41,850 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:33:41,851 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:33:41,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:33:41,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:33:41,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:33:41,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:33:41,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:33:41,855 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:33:41,855 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:33:41,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:33:41,856 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:33:41,856 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:33:41,856 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:33:41,857 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:33:41,857 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:33:41,857 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_a3d5f486-923a-45df-a847-c5148169616f/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_a3d5f486-923a-45df-a847-c5148169616f/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 -> 85aa73e9da404b3237f6b534f76a96725f8c968f66c8526708e2a81ace8745de [2023-11-19 07:33:42,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:33:42,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:33:42,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:33:42,159 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:33:42,159 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:33:42,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.i [2023-11-19 07:33:45,309 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:33:45,615 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:33:45,615 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.i [2023-11-19 07:33:45,628 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/data/f8b7752ce/8f1d9e41e432444c9e140a1a60a663ef/FLAGb10832023 [2023-11-19 07:33:45,650 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/data/f8b7752ce/8f1d9e41e432444c9e140a1a60a663ef [2023-11-19 07:33:45,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:33:45,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:33:45,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:33:45,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:33:45,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:33:45,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:33:45" (1/1) ... [2023-11-19 07:33:45,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@731c542e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:45, skipping insertion in model container [2023-11-19 07:33:45,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:33:45" (1/1) ... [2023-11-19 07:33:45,721 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:33:45,875 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_a3d5f486-923a-45df-a847-c5148169616f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.i[916,929] [2023-11-19 07:33:45,941 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:33:45,955 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:33:45,968 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_a3d5f486-923a-45df-a847-c5148169616f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.i[916,929] [2023-11-19 07:33:46,021 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:33:46,056 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:33:46,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:46 WrapperNode [2023-11-19 07:33:46,057 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:33:46,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:33:46,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:33:46,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:33:46,071 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:33:46" (1/1) ... [2023-11-19 07:33:46,086 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:33:46" (1/1) ... [2023-11-19 07:33:46,136 INFO L138 Inliner]: procedures = 29, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 401 [2023-11-19 07:33:46,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:33:46,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:33:46,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:33:46,137 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:33:46,148 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:46" (1/1) ... [2023-11-19 07:33:46,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:46" (1/1) ... [2023-11-19 07:33:46,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:46" (1/1) ... [2023-11-19 07:33:46,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:46" (1/1) ... [2023-11-19 07:33:46,178 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:46" (1/1) ... [2023-11-19 07:33:46,183 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:46" (1/1) ... [2023-11-19 07:33:46,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:46" (1/1) ... [2023-11-19 07:33:46,190 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:46" (1/1) ... [2023-11-19 07:33:46,196 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:33:46,197 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:33:46,197 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:33:46,197 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:33:46,198 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:46" (1/1) ... [2023-11-19 07:33:46,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:33:46,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:33:46,238 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/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:33:46,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/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:33:46,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:33:46,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-19 07:33:46,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:33:46,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-19 07:33:46,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:33:46,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-19 07:33:46,292 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:33:46,292 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:33:46,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:33:46,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:33:46,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:33:46,465 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:33:46,470 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:33:47,126 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:33:47,138 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:33:47,139 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:33:47,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:33:47 BoogieIcfgContainer [2023-11-19 07:33:47,144 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:33:47,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:33:47,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:33:47,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:33:47,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:33:45" (1/3) ... [2023-11-19 07:33:47,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d473483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:33:47, skipping insertion in model container [2023-11-19 07:33:47,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:46" (2/3) ... [2023-11-19 07:33:47,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d473483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:33:47, skipping insertion in model container [2023-11-19 07:33:47,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:33:47" (3/3) ... [2023-11-19 07:33:47,179 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-55.i [2023-11-19 07:33:47,199 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:33:47,199 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:33:47,286 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:33:47,294 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;@28f87fbc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:33:47,295 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:33:47,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 92 states have (on average 1.4565217391304348) internal successors, (134), 93 states have internal predecessors, (134), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:33:47,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-19 07:33:47,318 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:33:47,319 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:47,320 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:33:47,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:47,327 INFO L85 PathProgramCache]: Analyzing trace with hash -710735374, now seen corresponding path program 1 times [2023-11-19 07:33:47,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:47,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726690496] [2023-11-19 07:33:47,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:47,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:47,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:33:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:47,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:33:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:47,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:33:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:47,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:33:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:47,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:33:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:47,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:33:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:47,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:33:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:47,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:33:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:47,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:33:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:47,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:33:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:47,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:33:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:47,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:33:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:47,899 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:33:47,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:47,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726690496] [2023-11-19 07:33:47,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726690496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:47,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:47,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:33:47,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017379563] [2023-11-19 07:33:47,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:47,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:33:47,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:47,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:33:47,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:33:47,972 INFO L87 Difference]: Start difference. First operand has 107 states, 92 states have (on average 1.4565217391304348) internal successors, (134), 93 states have internal predecessors, (134), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-19 07:33:48,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:33:48,023 INFO L93 Difference]: Finished difference Result 207 states and 322 transitions. [2023-11-19 07:33:48,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:33:48,026 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2023-11-19 07:33:48,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:33:48,039 INFO L225 Difference]: With dead ends: 207 [2023-11-19 07:33:48,040 INFO L226 Difference]: Without dead ends: 103 [2023-11-19 07:33:48,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:33:48,051 INFO L413 NwaCegarLoop]: 151 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, 151 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:33:48,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:33:48,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-19 07:33:48,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-11-19 07:33:48,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 89 states have internal predecessors, (127), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:33:48,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2023-11-19 07:33:48,106 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 115 [2023-11-19 07:33:48,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:33:48,107 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2023-11-19 07:33:48,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-19 07:33:48,107 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2023-11-19 07:33:48,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-19 07:33:48,112 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:33:48,112 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:48,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:33:48,113 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:33:48,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:48,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1857949026, now seen corresponding path program 1 times [2023-11-19 07:33:48,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:48,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677907376] [2023-11-19 07:33:48,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:48,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:48,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:33:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:48,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:33:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:48,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:33:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:48,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:33:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:48,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:33:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:48,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:33:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:48,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:33:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:48,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:33:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:48,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:33:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:48,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:33:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:48,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:33:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:48,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:33:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:48,613 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:33:48,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:48,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677907376] [2023-11-19 07:33:48,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677907376] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:48,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:48,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:33:48,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007441851] [2023-11-19 07:33:48,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:48,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:33:48,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:48,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:33:48,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:33:48,620 INFO L87 Difference]: Start difference. First operand 103 states and 151 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:33:48,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:33:48,730 INFO L93 Difference]: Finished difference Result 215 states and 316 transitions. [2023-11-19 07:33:48,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:33:48,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-11-19 07:33:48,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:33:48,739 INFO L225 Difference]: With dead ends: 215 [2023-11-19 07:33:48,739 INFO L226 Difference]: Without dead ends: 115 [2023-11-19 07:33:48,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:33:48,742 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 21 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:33:48,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 440 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:33:48,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-19 07:33:48,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2023-11-19 07:33:48,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:33:48,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2023-11-19 07:33:48,778 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 115 [2023-11-19 07:33:48,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:33:48,781 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2023-11-19 07:33:48,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:33:48,781 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2023-11-19 07:33:48,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-19 07:33:48,784 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:33:48,784 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:48,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:33:48,785 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:33:48,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:48,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1756959900, now seen corresponding path program 1 times [2023-11-19 07:33:48,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:48,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007991141] [2023-11-19 07:33:48,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:48,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:33:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:33:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:33:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:33:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:33:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:33:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:33:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:33:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:33:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:33:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:33:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:33:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,162 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:33:49,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:49,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007991141] [2023-11-19 07:33:49,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007991141] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:49,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:49,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:33:49,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383930182] [2023-11-19 07:33:49,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:49,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:33:49,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:49,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:33:49,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:33:49,173 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:33:49,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:33:49,242 INFO L93 Difference]: Finished difference Result 215 states and 314 transitions. [2023-11-19 07:33:49,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:33:49,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-11-19 07:33:49,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:33:49,245 INFO L225 Difference]: With dead ends: 215 [2023-11-19 07:33:49,245 INFO L226 Difference]: Without dead ends: 113 [2023-11-19 07:33:49,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:33:49,248 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 12 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 438 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:33:49,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 438 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:33:49,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-19 07:33:49,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2023-11-19 07:33:49,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:33:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2023-11-19 07:33:49,262 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 115 [2023-11-19 07:33:49,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:33:49,263 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2023-11-19 07:33:49,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:33:49,264 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2023-11-19 07:33:49,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-19 07:33:49,266 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:33:49,266 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:49,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:33:49,267 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:33:49,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:49,268 INFO L85 PathProgramCache]: Analyzing trace with hash 18047462, now seen corresponding path program 1 times [2023-11-19 07:33:49,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:49,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103800029] [2023-11-19 07:33:49,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:49,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:33:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:33:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:33:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:33:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:33:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:33:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:33:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:33:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:33:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:33:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:33:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:33:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:49,523 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:33:49,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:49,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103800029] [2023-11-19 07:33:49,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103800029] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:49,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:49,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:33:49,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434575135] [2023-11-19 07:33:49,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:49,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:33:49,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:49,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:33:49,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:33:49,534 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:33:49,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:33:49,558 INFO L93 Difference]: Finished difference Result 211 states and 307 transitions. [2023-11-19 07:33:49,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:33:49,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-11-19 07:33:49,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:33:49,561 INFO L225 Difference]: With dead ends: 211 [2023-11-19 07:33:49,561 INFO L226 Difference]: Without dead ends: 107 [2023-11-19 07:33:49,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:33:49,564 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 4 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:33:49,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 289 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:33:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-19 07:33:49,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-11-19 07:33:49,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 93 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:33:49,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 154 transitions. [2023-11-19 07:33:49,577 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 154 transitions. Word has length 115 [2023-11-19 07:33:49,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:33:49,578 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 154 transitions. [2023-11-19 07:33:49,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:33:49,578 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 154 transitions. [2023-11-19 07:33:49,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-19 07:33:49,581 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:33:49,581 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:49,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:33:49,582 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:33:49,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:49,583 INFO L85 PathProgramCache]: Analyzing trace with hash 810511649, now seen corresponding path program 1 times [2023-11-19 07:33:49,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:49,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542970045] [2023-11-19 07:33:49,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:49,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:50,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:33:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:50,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:33:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:50,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:33:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:51,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:33:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:51,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:33:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:51,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:33:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:51,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:33:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:51,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:33:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:51,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:33:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:51,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:33:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:51,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:33:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:51,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:33:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:51,088 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:33:51,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:51,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542970045] [2023-11-19 07:33:51,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542970045] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:51,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:51,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:33:51,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450628303] [2023-11-19 07:33:51,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:51,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:33:51,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:51,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:33:51,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:33:51,094 INFO L87 Difference]: Start difference. First operand 107 states and 154 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:33:51,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:33:51,748 INFO L93 Difference]: Finished difference Result 366 states and 527 transitions. [2023-11-19 07:33:51,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:33:51,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2023-11-19 07:33:51,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:33:51,754 INFO L225 Difference]: With dead ends: 366 [2023-11-19 07:33:51,754 INFO L226 Difference]: Without dead ends: 262 [2023-11-19 07:33:51,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:33:51,764 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 175 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 07:33:51,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 490 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 07:33:51,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-11-19 07:33:51,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 166. [2023-11-19 07:33:51,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 139 states have (on average 1.3884892086330936) internal successors, (193), 139 states have internal predecessors, (193), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-19 07:33:51,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 241 transitions. [2023-11-19 07:33:51,818 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 241 transitions. Word has length 117 [2023-11-19 07:33:51,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:33:51,819 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 241 transitions. [2023-11-19 07:33:51,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:33:51,820 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 241 transitions. [2023-11-19 07:33:51,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-19 07:33:51,826 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:33:51,826 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:51,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:33:51,828 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:33:51,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:51,829 INFO L85 PathProgramCache]: Analyzing trace with hash -994926685, now seen corresponding path program 1 times [2023-11-19 07:33:51,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:51,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535232551] [2023-11-19 07:33:51,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:51,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:52,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:33:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:52,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:33:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:52,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:33:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:52,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:33:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:52,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:33:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:52,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:33:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:52,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:33:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:52,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:33:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:52,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:33:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:52,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:33:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:52,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:33:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:52,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:33:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:52,262 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:33:52,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:52,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535232551] [2023-11-19 07:33:52,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535232551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:52,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:52,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:33:52,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951588179] [2023-11-19 07:33:52,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:52,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:33:52,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:52,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:33:52,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:33:52,265 INFO L87 Difference]: Start difference. First operand 166 states and 241 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:33:52,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:33:52,593 INFO L93 Difference]: Finished difference Result 320 states and 461 transitions. [2023-11-19 07:33:52,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:33:52,593 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2023-11-19 07:33:52,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:33:52,595 INFO L225 Difference]: With dead ends: 320 [2023-11-19 07:33:52,596 INFO L226 Difference]: Without dead ends: 216 [2023-11-19 07:33:52,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:33:52,597 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 70 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:33:52,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 552 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:33:52,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-11-19 07:33:52,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 169. [2023-11-19 07:33:52,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 142 states have (on average 1.380281690140845) internal successors, (196), 142 states have internal predecessors, (196), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-19 07:33:52,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 244 transitions. [2023-11-19 07:33:52,615 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 244 transitions. Word has length 117 [2023-11-19 07:33:52,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:33:52,616 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 244 transitions. [2023-11-19 07:33:52,616 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:33:52,616 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 244 transitions. [2023-11-19 07:33:52,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-19 07:33:52,618 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:33:52,618 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:52,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:33:52,618 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:33:52,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:52,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1812575135, now seen corresponding path program 1 times [2023-11-19 07:33:52,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:52,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511674902] [2023-11-19 07:33:52,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:52,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:53,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:33:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:53,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:33:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:53,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:33:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:53,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:33:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:53,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:33:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:53,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:33:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:53,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:33:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:53,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:33:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:53,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:33:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:53,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:33:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:53,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:33:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:53,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:33:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:53,175 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:33:53,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:53,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511674902] [2023-11-19 07:33:53,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511674902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:53,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:53,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:33:53,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704541072] [2023-11-19 07:33:53,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:53,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:33:53,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:53,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:33:53,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:33:53,178 INFO L87 Difference]: Start difference. First operand 169 states and 244 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:33:53,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:33:53,488 INFO L93 Difference]: Finished difference Result 288 states and 411 transitions. [2023-11-19 07:33:53,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:33:53,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2023-11-19 07:33:53,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:33:53,491 INFO L225 Difference]: With dead ends: 288 [2023-11-19 07:33:53,491 INFO L226 Difference]: Without dead ends: 179 [2023-11-19 07:33:53,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:33:53,492 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 123 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:33:53,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 400 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:33:53,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-11-19 07:33:53,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2023-11-19 07:33:53,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 149 states have (on average 1.3624161073825503) internal successors, (203), 149 states have internal predecessors, (203), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-19 07:33:53,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 251 transitions. [2023-11-19 07:33:53,513 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 251 transitions. Word has length 117 [2023-11-19 07:33:53,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:33:53,514 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 251 transitions. [2023-11-19 07:33:53,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:33:53,515 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 251 transitions. [2023-11-19 07:33:53,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-19 07:33:53,516 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:33:53,516 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:53,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:33:53,517 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:33:53,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:53,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1672026525, now seen corresponding path program 1 times [2023-11-19 07:33:53,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:53,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874828427] [2023-11-19 07:33:53,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:53,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:54,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:33:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:54,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:33:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:54,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:33:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:54,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:33:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:54,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:33:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:54,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:33:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:54,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:33:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:54,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:33:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:54,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:33:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:54,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:33:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:54,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:33:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:54,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:33:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:54,717 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:33:54,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:54,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874828427] [2023-11-19 07:33:54,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874828427] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:54,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:54,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:33:54,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753219179] [2023-11-19 07:33:54,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:54,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:33:54,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:54,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:33:54,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:33:54,722 INFO L87 Difference]: Start difference. First operand 177 states and 251 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:33:55,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:33:55,090 INFO L93 Difference]: Finished difference Result 365 states and 516 transitions. [2023-11-19 07:33:55,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:33:55,091 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2023-11-19 07:33:55,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:33:55,093 INFO L225 Difference]: With dead ends: 365 [2023-11-19 07:33:55,094 INFO L226 Difference]: Without dead ends: 256 [2023-11-19 07:33:55,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:33:55,096 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 318 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:33:55,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 447 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:33:55,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-11-19 07:33:55,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 195. [2023-11-19 07:33:55,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 167 states have (on average 1.3532934131736527) internal successors, (226), 167 states have internal predecessors, (226), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-19 07:33:55,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 274 transitions. [2023-11-19 07:33:55,149 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 274 transitions. Word has length 117 [2023-11-19 07:33:55,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:33:55,149 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 274 transitions. [2023-11-19 07:33:55,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:33:55,150 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 274 transitions. [2023-11-19 07:33:55,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-19 07:33:55,151 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:33:55,151 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:55,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:33:55,152 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:33:55,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:55,152 INFO L85 PathProgramCache]: Analyzing trace with hash 995746142, now seen corresponding path program 1 times [2023-11-19 07:33:55,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:55,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640327039] [2023-11-19 07:33:55,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:55,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:55,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:33:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:55,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:33:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:55,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:33:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:55,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:33:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:55,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:33:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:55,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:33:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:55,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:33:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:55,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:33:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:55,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:33:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:55,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:33:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:55,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:33:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:55,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:33:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:55,585 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:33:55,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:55,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640327039] [2023-11-19 07:33:55,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640327039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:55,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:55,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:33:55,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946650633] [2023-11-19 07:33:55,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:55,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:33:55,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:55,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:33:55,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:33:55,589 INFO L87 Difference]: Start difference. First operand 195 states and 274 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:33:55,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:33:55,866 INFO L93 Difference]: Finished difference Result 406 states and 567 transitions. [2023-11-19 07:33:55,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:33:55,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2023-11-19 07:33:55,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:33:55,869 INFO L225 Difference]: With dead ends: 406 [2023-11-19 07:33:55,870 INFO L226 Difference]: Without dead ends: 281 [2023-11-19 07:33:55,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 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:33:55,871 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 228 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:33:55,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 452 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:33:55,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-11-19 07:33:55,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 233. [2023-11-19 07:33:55,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 202 states have (on average 1.3465346534653466) internal successors, (272), 203 states have internal predecessors, (272), 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:33:55,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 324 transitions. [2023-11-19 07:33:55,922 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 324 transitions. Word has length 119 [2023-11-19 07:33:55,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:33:55,922 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 324 transitions. [2023-11-19 07:33:55,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:33:55,923 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 324 transitions. [2023-11-19 07:33:55,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-19 07:33:55,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:33:55,925 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:55,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:33:55,925 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:33:55,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:55,926 INFO L85 PathProgramCache]: Analyzing trace with hash -15371108, now seen corresponding path program 1 times [2023-11-19 07:33:55,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:55,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502191159] [2023-11-19 07:33:55,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:55,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:56,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:33:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:56,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:33:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:56,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:33:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:56,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:33:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:56,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:33:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:56,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:33:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:56,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:33:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:56,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:33:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:56,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:33:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:56,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:33:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:56,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:33:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:56,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:33:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:33:56,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:56,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502191159] [2023-11-19 07:33:56,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502191159] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:56,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:56,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:33:56,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356881801] [2023-11-19 07:33:56,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:56,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:33:56,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:56,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:33:56,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:33:56,237 INFO L87 Difference]: Start difference. First operand 233 states and 324 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:33:56,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:33:56,321 INFO L93 Difference]: Finished difference Result 437 states and 610 transitions. [2023-11-19 07:33:56,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:33:56,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2023-11-19 07:33:56,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:33:56,329 INFO L225 Difference]: With dead ends: 437 [2023-11-19 07:33:56,329 INFO L226 Difference]: Without dead ends: 274 [2023-11-19 07:33:56,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:33:56,331 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 80 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:33:56,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 573 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:33:56,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2023-11-19 07:33:56,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 238. [2023-11-19 07:33:56,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 207 states have (on average 1.3381642512077294) internal successors, (277), 208 states have internal predecessors, (277), 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:33:56,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 329 transitions. [2023-11-19 07:33:56,368 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 329 transitions. Word has length 119 [2023-11-19 07:33:56,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:33:56,368 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 329 transitions. [2023-11-19 07:33:56,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:33:56,369 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 329 transitions. [2023-11-19 07:33:56,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-19 07:33:56,372 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:33:56,373 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:56,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:33:56,374 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:33:56,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:56,375 INFO L85 PathProgramCache]: Analyzing trace with hash -629945927, now seen corresponding path program 1 times [2023-11-19 07:33:56,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:56,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128189947] [2023-11-19 07:33:56,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:56,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:57,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:33:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:57,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:33:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:57,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:33:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:57,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:33:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:57,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:33:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:57,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:33:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:57,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:33:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:57,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:33:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:57,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:33:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:57,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:33:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:57,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:33:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:57,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:33:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:57,676 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:33:57,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:57,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128189947] [2023-11-19 07:33:57,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128189947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:57,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:57,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:33:57,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008963073] [2023-11-19 07:33:57,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:57,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:33:57,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:57,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:33:57,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:33:57,680 INFO L87 Difference]: Start difference. First operand 238 states and 329 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:33:58,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:33:58,107 INFO L93 Difference]: Finished difference Result 553 states and 766 transitions. [2023-11-19 07:33:58,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:33:58,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2023-11-19 07:33:58,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:33:58,113 INFO L225 Difference]: With dead ends: 553 [2023-11-19 07:33:58,113 INFO L226 Difference]: Without dead ends: 385 [2023-11-19 07:33:58,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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:33:58,114 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 100 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:33:58,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 349 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:33:58,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2023-11-19 07:33:58,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 382. [2023-11-19 07:33:58,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 335 states have (on average 1.3432835820895523) internal successors, (450), 337 states have internal predecessors, (450), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-19 07:33:58,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 530 transitions. [2023-11-19 07:33:58,165 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 530 transitions. Word has length 119 [2023-11-19 07:33:58,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:33:58,165 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 530 transitions. [2023-11-19 07:33:58,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:33:58,166 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 530 transitions. [2023-11-19 07:33:58,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-19 07:33:58,168 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:33:58,168 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:58,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:33:58,168 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:33:58,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:58,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1041934585, now seen corresponding path program 1 times [2023-11-19 07:33:58,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:58,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014603630] [2023-11-19 07:33:58,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:58,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:59,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:33:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:59,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:33:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:59,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:33:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:59,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:33:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:59,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:33:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:59,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:33:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:59,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:33:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:59,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:33:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:59,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:33:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:59,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:33:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:59,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:33:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:59,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:33:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:59,732 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:33:59,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:59,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014603630] [2023-11-19 07:33:59,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014603630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:59,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:59,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 07:33:59,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688709106] [2023-11-19 07:33:59,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:59,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 07:33:59,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:59,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:33:59,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:33:59,735 INFO L87 Difference]: Start difference. First operand 382 states and 530 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-19 07:34:00,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:34:00,468 INFO L93 Difference]: Finished difference Result 723 states and 1000 transitions. [2023-11-19 07:34:00,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:34:00,469 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2023-11-19 07:34:00,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:34:00,473 INFO L225 Difference]: With dead ends: 723 [2023-11-19 07:34:00,474 INFO L226 Difference]: Without dead ends: 411 [2023-11-19 07:34:00,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:34:00,475 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 281 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 07:34:00,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 578 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 07:34:00,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2023-11-19 07:34:00,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 371. [2023-11-19 07:34:00,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 326 states have (on average 1.3466257668711656) internal successors, (439), 327 states have internal predecessors, (439), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-19 07:34:00,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 515 transitions. [2023-11-19 07:34:00,536 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 515 transitions. Word has length 119 [2023-11-19 07:34:00,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:34:00,537 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 515 transitions. [2023-11-19 07:34:00,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-19 07:34:00,537 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 515 transitions. [2023-11-19 07:34:00,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-19 07:34:00,539 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:34:00,539 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:00,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:34:00,540 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:34:00,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:00,541 INFO L85 PathProgramCache]: Analyzing trace with hash -815962526, now seen corresponding path program 1 times [2023-11-19 07:34:00,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:00,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800441850] [2023-11-19 07:34:00,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:00,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:00,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:34:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:00,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:34:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:00,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:34:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:00,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:34:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:00,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:34:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:00,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:34:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:00,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:34:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:00,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:34:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:00,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:34:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:00,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:34:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:00,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:34:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:00,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:34:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:34:00,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:00,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800441850] [2023-11-19 07:34:00,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800441850] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:00,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:00,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:34:00,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528817380] [2023-11-19 07:34:00,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:00,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:34:00,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:34:00,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:34:00,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:34:00,748 INFO L87 Difference]: Start difference. First operand 371 states and 515 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:34:00,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:34:00,836 INFO L93 Difference]: Finished difference Result 762 states and 1056 transitions. [2023-11-19 07:34:00,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:34:00,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2023-11-19 07:34:00,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:34:00,840 INFO L225 Difference]: With dead ends: 762 [2023-11-19 07:34:00,841 INFO L226 Difference]: Without dead ends: 461 [2023-11-19 07:34:00,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:34:00,843 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 66 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:34:00,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 630 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:34:00,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2023-11-19 07:34:00,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 380. [2023-11-19 07:34:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 335 states have (on average 1.337313432835821) internal successors, (448), 336 states have internal predecessors, (448), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-19 07:34:00,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 524 transitions. [2023-11-19 07:34:00,896 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 524 transitions. Word has length 120 [2023-11-19 07:34:00,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:34:00,897 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 524 transitions. [2023-11-19 07:34:00,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:34:00,897 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 524 transitions. [2023-11-19 07:34:00,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-19 07:34:00,899 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:34:00,899 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:00,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:34:00,900 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:34:00,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:00,900 INFO L85 PathProgramCache]: Analyzing trace with hash -984380921, now seen corresponding path program 1 times [2023-11-19 07:34:00,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:00,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262409017] [2023-11-19 07:34:00,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:00,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:00,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:34:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:00,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:34:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:00,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:34:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:00,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:34:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:00,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:34:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:00,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:34:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:00,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:34:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:00,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:34:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:01,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:34:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:01,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:34:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:01,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:34:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:01,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:34:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:01,011 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:34:01,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:01,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262409017] [2023-11-19 07:34:01,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262409017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:01,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:01,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:34:01,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128305489] [2023-11-19 07:34:01,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:01,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:34:01,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:34:01,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:34:01,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:34:01,014 INFO L87 Difference]: Start difference. First operand 380 states and 524 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:34:01,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:34:01,061 INFO L93 Difference]: Finished difference Result 587 states and 810 transitions. [2023-11-19 07:34:01,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:34:01,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2023-11-19 07:34:01,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:34:01,069 INFO L225 Difference]: With dead ends: 587 [2023-11-19 07:34:01,069 INFO L226 Difference]: Without dead ends: 383 [2023-11-19 07:34:01,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:34:01,070 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 292 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:34:01,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 292 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:34:01,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2023-11-19 07:34:01,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 382. [2023-11-19 07:34:01,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 337 states have (on average 1.3353115727002967) internal successors, (450), 338 states have internal predecessors, (450), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-19 07:34:01,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 526 transitions. [2023-11-19 07:34:01,122 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 526 transitions. Word has length 120 [2023-11-19 07:34:01,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:34:01,123 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 526 transitions. [2023-11-19 07:34:01,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:34:01,131 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 526 transitions. [2023-11-19 07:34:01,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-19 07:34:01,133 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:34:01,133 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:01,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:34:01,134 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:34:01,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:01,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1924382981, now seen corresponding path program 1 times [2023-11-19 07:34:01,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:01,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272733123] [2023-11-19 07:34:01,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:01,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:01,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:34:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:01,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:34:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:01,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:34:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:01,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:34:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:01,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:34:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:01,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:34:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:01,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:34:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:01,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:34:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:01,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:34:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:01,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:34:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:01,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:34:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:01,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:34:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:01,555 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:34:01,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:01,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272733123] [2023-11-19 07:34:01,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272733123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:01,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:01,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:34:01,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765664387] [2023-11-19 07:34:01,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:01,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:34:01,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:34:01,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:34:01,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:34:01,558 INFO L87 Difference]: Start difference. First operand 382 states and 526 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:34:01,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:34:01,791 INFO L93 Difference]: Finished difference Result 847 states and 1158 transitions. [2023-11-19 07:34:01,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:34:01,792 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2023-11-19 07:34:01,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:34:01,796 INFO L225 Difference]: With dead ends: 847 [2023-11-19 07:34:01,796 INFO L226 Difference]: Without dead ends: 529 [2023-11-19 07:34:01,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:34:01,799 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 123 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:34:01,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 633 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:34:01,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2023-11-19 07:34:01,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 410. [2023-11-19 07:34:01,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 365 states have (on average 1.3315068493150686) internal successors, (486), 366 states have internal predecessors, (486), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-19 07:34:01,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 562 transitions. [2023-11-19 07:34:01,852 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 562 transitions. Word has length 120 [2023-11-19 07:34:01,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:34:01,853 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 562 transitions. [2023-11-19 07:34:01,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:34:01,853 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 562 transitions. [2023-11-19 07:34:01,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-19 07:34:01,855 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:34:01,855 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:01,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:34:01,855 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:34:01,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:01,856 INFO L85 PathProgramCache]: Analyzing trace with hash -960471651, now seen corresponding path program 1 times [2023-11-19 07:34:01,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:01,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704187385] [2023-11-19 07:34:01,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:01,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:02,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:34:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:02,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:34:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:02,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:34:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:02,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:34:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:02,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:34:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:02,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:34:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:02,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:34:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:02,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:34:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:02,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:34:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:02,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:34:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:02,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:34:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:02,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:34:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:02,114 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:34:02,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:02,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704187385] [2023-11-19 07:34:02,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704187385] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:02,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:02,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:34:02,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900629873] [2023-11-19 07:34:02,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:02,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:34:02,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:34:02,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:34:02,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:34:02,120 INFO L87 Difference]: Start difference. First operand 410 states and 562 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:34:02,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:34:02,414 INFO L93 Difference]: Finished difference Result 937 states and 1282 transitions. [2023-11-19 07:34:02,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:34:02,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2023-11-19 07:34:02,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:34:02,419 INFO L225 Difference]: With dead ends: 937 [2023-11-19 07:34:02,419 INFO L226 Difference]: Without dead ends: 619 [2023-11-19 07:34:02,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:34:02,421 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 173 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:34:02,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 851 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:34:02,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2023-11-19 07:34:02,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 407. [2023-11-19 07:34:02,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 362 states have (on average 1.3176795580110496) internal successors, (477), 363 states have internal predecessors, (477), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-19 07:34:02,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 553 transitions. [2023-11-19 07:34:02,474 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 553 transitions. Word has length 122 [2023-11-19 07:34:02,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:34:02,475 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 553 transitions. [2023-11-19 07:34:02,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:34:02,475 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 553 transitions. [2023-11-19 07:34:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-19 07:34:02,478 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:34:02,478 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:02,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 07:34:02,479 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:34:02,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:02,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1645551903, now seen corresponding path program 1 times [2023-11-19 07:34:02,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:02,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098528502] [2023-11-19 07:34:02,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:02,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:03,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:34:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:03,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:34:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:03,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:34:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:03,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:34:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:03,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:34:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:03,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:34:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:03,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:34:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:03,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:34:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:04,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:34:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:04,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:34:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:04,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:34:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:04,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:34:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:34:04,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:04,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098528502] [2023-11-19 07:34:04,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098528502] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:04,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:04,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-19 07:34:04,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368768771] [2023-11-19 07:34:04,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:04,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-19 07:34:04,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:34:04,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-19 07:34:04,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:34:04,026 INFO L87 Difference]: Start difference. First operand 407 states and 553 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-19 07:34:04,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:34:04,709 INFO L93 Difference]: Finished difference Result 671 states and 909 transitions. [2023-11-19 07:34:04,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:34:04,710 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 122 [2023-11-19 07:34:04,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:34:04,715 INFO L225 Difference]: With dead ends: 671 [2023-11-19 07:34:04,715 INFO L226 Difference]: Without dead ends: 468 [2023-11-19 07:34:04,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-11-19 07:34:04,717 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 540 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:34:04,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 423 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:34:04,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2023-11-19 07:34:04,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 397. [2023-11-19 07:34:04,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 352 states have (on average 1.3153409090909092) internal successors, (463), 353 states have internal predecessors, (463), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-19 07:34:04,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 539 transitions. [2023-11-19 07:34:04,761 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 539 transitions. Word has length 122 [2023-11-19 07:34:04,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:34:04,762 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 539 transitions. [2023-11-19 07:34:04,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-19 07:34:04,762 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 539 transitions. [2023-11-19 07:34:04,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:34:04,764 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:34:04,764 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:04,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 07:34:04,765 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:34:04,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:04,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1080541022, now seen corresponding path program 1 times [2023-11-19 07:34:04,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:04,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256034370] [2023-11-19 07:34:04,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:04,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:04,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:34:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:04,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:34:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:04,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:34:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:04,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:34:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:04,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:34:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:04,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:34:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:04,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:34:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:04,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:34:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:04,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:34:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:04,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:34:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:04,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:34:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:04,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:34:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:04,952 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:34:04,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:04,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256034370] [2023-11-19 07:34:04,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256034370] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:04,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:04,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:34:04,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295121712] [2023-11-19 07:34:04,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:04,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:34:04,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:34:04,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:34:04,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:34:04,955 INFO L87 Difference]: Start difference. First operand 397 states and 539 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:34:05,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:34:05,002 INFO L93 Difference]: Finished difference Result 727 states and 988 transitions. [2023-11-19 07:34:05,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:34:05,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2023-11-19 07:34:05,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:34:05,007 INFO L225 Difference]: With dead ends: 727 [2023-11-19 07:34:05,007 INFO L226 Difference]: Without dead ends: 412 [2023-11-19 07:34:05,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:34:05,009 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 19 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:34:05,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 287 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:34:05,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2023-11-19 07:34:05,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 397. [2023-11-19 07:34:05,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 352 states have (on average 1.3068181818181819) internal successors, (460), 353 states have internal predecessors, (460), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-19 07:34:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 536 transitions. [2023-11-19 07:34:05,054 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 536 transitions. Word has length 124 [2023-11-19 07:34:05,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:34:05,055 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 536 transitions. [2023-11-19 07:34:05,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:34:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 536 transitions. [2023-11-19 07:34:05,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-19 07:34:05,057 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:34:05,058 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:05,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-19 07:34:05,058 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:34:05,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:05,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1850838089, now seen corresponding path program 1 times [2023-11-19 07:34:05,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:05,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607004473] [2023-11-19 07:34:05,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:05,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:34:05,182 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:34:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:34:05,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:34:05,358 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:34:05,360 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 07:34:05,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-19 07:34:05,366 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] [2023-11-19 07:34:05,370 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:34:05,451 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem29 could not be translated [2023-11-19 07:34:05,453 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem29 could not be translated [2023-11-19 07:34:05,456 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem30 could not be translated [2023-11-19 07:34:05,465 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem30 could not be translated [2023-11-19 07:34:05,466 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated [2023-11-19 07:34:05,467 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated [2023-11-19 07:34:05,468 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem33 could not be translated [2023-11-19 07:34:05,470 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem33 could not be translated [2023-11-19 07:34:05,472 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated [2023-11-19 07:34:05,472 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated [2023-11-19 07:34:05,473 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated [2023-11-19 07:34:05,474 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short41 could not be translated [2023-11-19 07:34:05,474 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short37 could not be translated [2023-11-19 07:34:05,474 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated [2023-11-19 07:34:05,475 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short41 could not be translated [2023-11-19 07:34:05,476 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short37 could not be translated [2023-11-19 07:34:05,477 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated [2023-11-19 07:34:05,479 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated [2023-11-19 07:34:05,480 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem43 could not be translated [2023-11-19 07:34:05,480 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated [2023-11-19 07:34:05,481 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short45 could not be translated [2023-11-19 07:34:05,481 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem43 could not be translated [2023-11-19 07:34:05,481 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated [2023-11-19 07:34:05,481 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short49 could not be translated [2023-11-19 07:34:05,482 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short45 could not be translated [2023-11-19 07:34:05,483 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem43 could not be translated [2023-11-19 07:34:05,484 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short49 could not be translated [2023-11-19 07:34:05,484 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated [2023-11-19 07:34:05,484 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated [2023-11-19 07:34:05,484 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated [2023-11-19 07:34:05,485 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated [2023-11-19 07:34:05,485 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated [2023-11-19 07:34:05,485 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short57 could not be translated [2023-11-19 07:34:05,485 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short53 could not be translated [2023-11-19 07:34:05,486 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated [2023-11-19 07:34:05,488 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated [2023-11-19 07:34:05,488 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short53 could not be translated [2023-11-19 07:34:05,488 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short57 could not be translated [2023-11-19 07:34:05,489 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated [2023-11-19 07:34:05,489 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated [2023-11-19 07:34:05,489 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short65 could not be translated [2023-11-19 07:34:05,490 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated [2023-11-19 07:34:05,490 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated [2023-11-19 07:34:05,491 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short61 could not be translated [2023-11-19 07:34:05,491 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated [2023-11-19 07:34:05,491 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short61 could not be translated [2023-11-19 07:34:05,492 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short65 could not be translated [2023-11-19 07:34:05,492 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated [2023-11-19 07:34:05,492 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated [2023-11-19 07:34:05,494 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated [2023-11-19 07:34:05,495 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated [2023-11-19 07:34:05,495 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated [2023-11-19 07:34:05,496 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated [2023-11-19 07:34:05,496 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated [2023-11-19 07:34:05,499 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem71 could not be translated [2023-11-19 07:34:05,499 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem71 could not be translated [2023-11-19 07:34:05,501 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem4 could not be translated [2023-11-19 07:34:05,501 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short6 could not be translated [2023-11-19 07:34:05,502 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated [2023-11-19 07:34:05,502 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated [2023-11-19 07:34:05,502 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated [2023-11-19 07:34:05,502 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-19 07:34:05,503 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-19 07:34:05,503 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated [2023-11-19 07:34:05,503 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated [2023-11-19 07:34:05,503 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated [2023-11-19 07:34:05,504 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-19 07:34:05,504 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated [2023-11-19 07:34:05,504 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated [2023-11-19 07:34:05,504 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated [2023-11-19 07:34:05,504 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet19 could not be translated [2023-11-19 07:34:05,504 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-19 07:34:05,505 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated [2023-11-19 07:34:05,505 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated [2023-11-19 07:34:05,505 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated [2023-11-19 07:34:05,505 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-19 07:34:05,505 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated [2023-11-19 07:34:05,506 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet19 could not be translated [2023-11-19 07:34:05,506 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite21 could not be translated [2023-11-19 07:34:05,506 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated [2023-11-19 07:34:05,506 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem23 could not be translated [2023-11-19 07:34:05,507 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated [2023-11-19 07:34:05,507 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short76 could not be translated [2023-11-19 07:34:05,507 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated [2023-11-19 07:34:05,507 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite80 could not be translated [2023-11-19 07:34:05,508 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated [2023-11-19 07:34:05,508 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short76 could not be translated [2023-11-19 07:34:05,508 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite80 could not be translated [2023-11-19 07:34:05,508 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated [2023-11-19 07:34:05,508 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite82 could not be translated [2023-11-19 07:34:05,508 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short76 could not be translated [2023-11-19 07:34:05,509 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short90 could not be translated [2023-11-19 07:34:05,509 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated [2023-11-19 07:34:05,509 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-19 07:34:05,509 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite80 could not be translated [2023-11-19 07:34:05,509 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short76 could not be translated [2023-11-19 07:34:05,510 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite82 could not be translated [2023-11-19 07:34:05,510 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite80 could not be translated [2023-11-19 07:34:05,510 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated [2023-11-19 07:34:05,510 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-19 07:34:05,510 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short90 could not be translated [2023-11-19 07:34:05,510 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated [2023-11-19 07:34:05,511 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-19 07:34:05,511 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated [2023-11-19 07:34:05,511 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite89 could not be translated [2023-11-19 07:34:05,511 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short76 could not be translated [2023-11-19 07:34:05,511 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite82 could not be translated [2023-11-19 07:34:05,511 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated [2023-11-19 07:34:05,512 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated [2023-11-19 07:34:05,512 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite89 could not be translated [2023-11-19 07:34:05,512 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated [2023-11-19 07:34:05,512 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short76 could not be translated [2023-11-19 07:34:05,512 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite80 could not be translated [2023-11-19 07:34:05,513 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated [2023-11-19 07:34:05,513 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated [2023-11-19 07:34:05,513 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated [2023-11-19 07:34:05,513 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short90 could not be translated [2023-11-19 07:34:05,513 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite82 could not be translated [2023-11-19 07:34:05,513 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-19 07:34:05,515 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated [2023-11-19 07:34:05,515 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-19 07:34:05,515 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short108 could not be translated [2023-11-19 07:34:05,515 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-19 07:34:05,516 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite82 could not be translated [2023-11-19 07:34:05,516 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short90 could not be translated [2023-11-19 07:34:05,516 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite89 could not be translated [2023-11-19 07:34:05,516 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-19 07:34:05,516 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated [2023-11-19 07:34:05,517 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite80 could not be translated [2023-11-19 07:34:05,517 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short76 could not be translated [2023-11-19 07:34:05,517 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated [2023-11-19 07:34:05,517 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated [2023-11-19 07:34:05,517 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated [2023-11-19 07:34:05,517 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated [2023-11-19 07:34:05,518 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite82 could not be translated [2023-11-19 07:34:05,518 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite80 could not be translated [2023-11-19 07:34:05,518 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite89 could not be translated [2023-11-19 07:34:05,518 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated [2023-11-19 07:34:05,518 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated [2023-11-19 07:34:05,518 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-19 07:34:05,519 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short90 could not be translated [2023-11-19 07:34:05,519 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated [2023-11-19 07:34:05,519 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short76 could not be translated [2023-11-19 07:34:05,519 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short108 could not be translated [2023-11-19 07:34:05,519 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated [2023-11-19 07:34:05,519 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-19 07:34:05,519 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated [2023-11-19 07:34:05,520 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated [2023-11-19 07:34:05,520 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated [2023-11-19 07:34:05,520 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite89 could not be translated [2023-11-19 07:34:05,520 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite82 could not be translated [2023-11-19 07:34:05,520 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated [2023-11-19 07:34:05,521 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated [2023-11-19 07:34:05,521 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short114 could not be translated [2023-11-19 07:34:05,521 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-19 07:34:05,521 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite80 could not be translated [2023-11-19 07:34:05,521 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short108 could not be translated [2023-11-19 07:34:05,521 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated [2023-11-19 07:34:05,521 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short90 could not be translated [2023-11-19 07:34:05,522 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short76 could not be translated [2023-11-19 07:34:05,522 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated [2023-11-19 07:34:05,522 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated [2023-11-19 07:34:05,522 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-19 07:34:05,522 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated [2023-11-19 07:34:05,522 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-19 07:34:05,523 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated [2023-11-19 07:34:05,523 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated [2023-11-19 07:34:05,523 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short76 could not be translated [2023-11-19 07:34:05,523 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-19 07:34:05,523 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite82 could not be translated [2023-11-19 07:34:05,523 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite80 could not be translated [2023-11-19 07:34:05,523 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated [2023-11-19 07:34:05,524 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite89 could not be translated [2023-11-19 07:34:05,524 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short117 could not be translated [2023-11-19 07:34:05,524 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated [2023-11-19 07:34:05,524 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated [2023-11-19 07:34:05,524 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short108 could not be translated [2023-11-19 07:34:05,524 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short90 could not be translated [2023-11-19 07:34:05,525 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short114 could not be translated [2023-11-19 07:34:05,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:34:05 BoogieIcfgContainer [2023-11-19 07:34:05,560 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:34:05,560 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:34:05,560 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:34:05,561 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:34:05,561 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:33:47" (3/4) ... [2023-11-19 07:34:05,564 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 07:34:05,565 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:34:05,565 INFO L158 Benchmark]: Toolchain (without parser) took 19905.88ms. Allocated memory was 130.0MB in the beginning and 360.7MB in the end (delta: 230.7MB). Free memory was 97.0MB in the beginning and 212.5MB in the end (delta: -115.6MB). Peak memory consumption was 117.1MB. Max. memory is 16.1GB. [2023-11-19 07:34:05,566 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 107.0MB. Free memory is still 61.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:34:05,566 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.44ms. Allocated memory is still 130.0MB. Free memory was 96.5MB in the beginning and 82.0MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-19 07:34:05,567 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.86ms. Allocated memory is still 130.0MB. Free memory was 82.0MB in the beginning and 78.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 07:34:05,567 INFO L158 Benchmark]: Boogie Preprocessor took 58.94ms. Allocated memory is still 130.0MB. Free memory was 78.3MB in the beginning and 75.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:34:05,567 INFO L158 Benchmark]: RCFGBuilder took 947.46ms. Allocated memory is still 130.0MB. Free memory was 75.3MB in the beginning and 45.9MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-11-19 07:34:05,568 INFO L158 Benchmark]: TraceAbstraction took 18412.47ms. Allocated memory was 130.0MB in the beginning and 360.7MB in the end (delta: 230.7MB). Free memory was 45.6MB in the beginning and 212.5MB in the end (delta: -167.0MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. [2023-11-19 07:34:05,568 INFO L158 Benchmark]: Witness Printer took 4.76ms. Allocated memory is still 360.7MB. Free memory is still 212.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:34:05,577 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.32ms. Allocated memory is still 107.0MB. Free memory is still 61.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.44ms. Allocated memory is still 130.0MB. Free memory was 96.5MB in the beginning and 82.0MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.86ms. Allocated memory is still 130.0MB. Free memory was 82.0MB in the beginning and 78.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.94ms. Allocated memory is still 130.0MB. Free memory was 78.3MB in the beginning and 75.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 947.46ms. Allocated memory is still 130.0MB. Free memory was 75.3MB in the beginning and 45.9MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 18412.47ms. Allocated memory was 130.0MB in the beginning and 360.7MB in the end (delta: 230.7MB). Free memory was 45.6MB in the beginning and 212.5MB in the end (delta: -167.0MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. * Witness Printer took 4.76ms. Allocated memory is still 360.7MB. Free memory is still 212.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem30 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem30 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem33 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem36 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem43 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short45 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem43 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short49 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short45 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem43 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short49 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short57 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short53 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem51 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem52 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short53 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short57 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short65 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short61 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short61 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short65 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem59 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem68 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem71 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem71 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem23 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite80 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite80 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite82 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite80 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite82 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite80 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite82 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite80 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite82 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short108 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite82 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite80 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite82 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite80 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short108 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite82 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short114 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite80 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short108 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem74 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short76 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite82 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite80 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short117 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem88 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short108 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short114 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of shiftRight at line 67, overapproximation of someBinaryArithmeticDOUBLEoperation at line 62. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[5] = { 1.8, 63.5, 0.25, 256.75, 16.5 }; [L28-L30] float float_Array_0[1] = { 4.6 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -5 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 2, 128, 100 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[1] = { 500 }; [L40-L42] unsigned short int unsigned_short_int_Array_0[1] = { 10 }; [L43] signed long int last_1_signed_long_int_Array_0_0_ = -5; [L44] unsigned char last_1_unsigned_char_Array_0_0_ = 2; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L100] EXPR signed_long_int_Array_0[0] [L100] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L101] EXPR unsigned_char_Array_0[0] [L101] last_1_unsigned_char_Array_0_0_ = unsigned_char_Array_0[0] [L111] RET updateLastVariables() [L112] CALL updateVariables() [L78] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L81] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L82] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L83] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L83] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L83] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L84] double_Array_0[0] = __VERIFIER_nondet_double() [L85] EXPR double_Array_0[0] [L85] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L85] EXPR double_Array_0[0] [L85] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L86] double_Array_0[1] = __VERIFIER_nondet_double() [L87] EXPR double_Array_0[1] [L87] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L87] EXPR double_Array_0[1] [L87] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L87] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 2305843.009213691390e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L87] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 2305843.009213691390e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L87] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 2305843.009213691390e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L88] double_Array_0[2] = __VERIFIER_nondet_double() [L89] EXPR double_Array_0[2] [L89] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F [L89] EXPR double_Array_0[2] [L89] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L89] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L89] CALL assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L89] RET assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L90] double_Array_0[4] = __VERIFIER_nondet_double() [L91] EXPR double_Array_0[4] [L91] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F [L91] EXPR double_Array_0[4] [L91] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] CALL assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] RET assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L92] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L93] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L93] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L93] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L94] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L95] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L96] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L112] RET updateVariables() [L113] CALL step() [L48] unsigned char stepLocal_1 = last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_; [L49] signed long int stepLocal_0 = last_1_unsigned_char_Array_0_0_; [L50] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, stepLocal_0=2, stepLocal_1=0, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L50] COND TRUE BOOL_unsigned_char_Array_0[1] [L51] stepLocal_1 && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, stepLocal_0=2, stepLocal_1=0, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L51] COND FALSE !(stepLocal_1 && BOOL_unsigned_char_Array_0[0]) [L61] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, stepLocal_0=2, stepLocal_1=0, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L61] COND TRUE BOOL_unsigned_char_Array_0[1] [L62] EXPR double_Array_0[1] [L62] EXPR double_Array_0[0] [L62] EXPR double_Array_0[2] [L62] EXPR double_Array_0[4] [L62] double_Array_0[3] = (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]) [L64] EXPR double_Array_0[1] [L64] float_Array_0[0] = double_Array_0[1] [L65] EXPR unsigned_char_Array_0[1] [L65] unsigned_long_int_Array_0[0] = unsigned_char_Array_0[1] [L66] EXPR unsigned_char_Array_0[2] [L66] unsigned_char_Array_0[0] = unsigned_char_Array_0[2] [L67] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, stepLocal_0=2, stepLocal_1=0, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L67] EXPR -4 >> unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, stepLocal_0=2, stepLocal_1=0, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L67] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, stepLocal_0=2, stepLocal_1=0, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L67] EXPR (((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0]) [L67] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, stepLocal_0=2, stepLocal_1=0, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L67] EXPR -4 >> unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, stepLocal_0=2, stepLocal_1=0, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L67] EXPR (((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, stepLocal_0=2, stepLocal_1=0, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L67] signed long int stepLocal_3 = ((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])); [L68] EXPR unsigned_short_int_Array_0[0] [L68] signed long int stepLocal_2 = unsigned_short_int_Array_0[0] / -8; [L69] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, stepLocal_0=2, stepLocal_1=0, stepLocal_2=-1, stepLocal_3=-256, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L69] COND FALSE !((~ unsigned_char_Array_0[0]) <= stepLocal_3) [L74] EXPR unsigned_char_Array_0[0] [L74] EXPR unsigned_char_Array_0[1] [L74] signed_long_int_Array_0[0] = (unsigned_char_Array_0[0] - unsigned_char_Array_0[1]) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_)) [L104] EXPR (last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR (BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1) [L104] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1 [L104] EXPR double_Array_0[3] [L104] EXPR double_Array_0[1] [L104] EXPR double_Array_0[0] [L104] EXPR double_Array_0[2] [L104] EXPR double_Array_0[4] [L104] EXPR BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR (BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR ((BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1)) && (((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR (((BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1)) && (((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR ((((BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1)) && (((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1]))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104] EXPR (((((BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1)) && (((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1]))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L104-L105] return (((((BOOL_unsigned_char_Array_0[1] ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && BOOL_unsigned_char_Array_0[0]) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) 5)) : (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[3] == ((double) (((double_Array_0[1] + double_Array_0[0]) + double_Array_0[2]) - double_Array_0[4]))) : 1)) && (((~ unsigned_char_Array_0[0]) <= (((((-4 >> unsigned_short_int_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((-4 >> unsigned_short_int_Array_0[0])) : (unsigned_short_int_Array_0[0])))) ? (((unsigned_char_Array_0[1] - 64) < (unsigned_short_int_Array_0[0] / -8)) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1]))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[1]))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[2])) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.1s, OverallIterations: 19, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2335 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2333 mSDsluCounter, 8275 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5654 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2580 IncrementalHoareTripleChecker+Invalid, 2678 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 2621 mSDtfsCounter, 2580 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 601 GetRequests, 512 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=410occurred in iteration=15, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 848 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 2256 NumberOfCodeBlocks, 2256 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2114 ConstructedInterpolants, 0 QuantifiedInterpolants, 8889 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 4752/4752 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-19 07:34:05,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/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_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/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 85aa73e9da404b3237f6b534f76a96725f8c968f66c8526708e2a81ace8745de --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:34:08,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:34:08,498 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-19 07:34:08,504 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:34:08,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:34:08,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:34:08,552 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:34:08,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:34:08,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:34:08,558 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:34:08,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:34:08,560 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:34:08,560 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:34:08,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:34:08,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:34:08,563 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:34:08,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:34:08,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:34:08,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:34:08,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:34:08,565 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:34:08,566 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:34:08,566 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 07:34:08,566 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 07:34:08,567 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:34:08,567 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:34:08,567 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:34:08,568 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:34:08,568 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:34:08,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:34:08,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:34:08,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:34:08,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:34:08,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:34:08,571 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-19 07:34:08,571 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 07:34:08,571 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:34:08,572 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:34:08,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:34:08,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:34:08,573 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-19 07:34:08,573 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:34:08,574 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_a3d5f486-923a-45df-a847-c5148169616f/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_a3d5f486-923a-45df-a847-c5148169616f/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 -> 85aa73e9da404b3237f6b534f76a96725f8c968f66c8526708e2a81ace8745de [2023-11-19 07:34:09,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:34:09,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:34:09,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:34:09,039 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:34:09,041 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:34:09,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.i [2023-11-19 07:34:12,287 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:34:12,598 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:34:12,599 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.i [2023-11-19 07:34:12,610 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/data/22c1ee231/9285537285cc46eebacffa41ee49fa60/FLAGcdce4e719 [2023-11-19 07:34:12,623 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/data/22c1ee231/9285537285cc46eebacffa41ee49fa60 [2023-11-19 07:34:12,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:34:12,627 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:34:12,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:34:12,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:34:12,635 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:34:12,636 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:34:12" (1/1) ... [2023-11-19 07:34:12,637 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fc2b2fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:12, skipping insertion in model container [2023-11-19 07:34:12,637 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:34:12" (1/1) ... [2023-11-19 07:34:12,673 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:34:12,833 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_a3d5f486-923a-45df-a847-c5148169616f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.i[916,929] [2023-11-19 07:34:12,894 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:34:12,911 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:34:12,924 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_a3d5f486-923a-45df-a847-c5148169616f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-55.i[916,929] [2023-11-19 07:34:12,972 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:34:13,003 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:34:13,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:13 WrapperNode [2023-11-19 07:34:13,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:34:13,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:34:13,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:34:13,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:34:13,014 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:34:13" (1/1) ... [2023-11-19 07:34:13,042 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:34:13" (1/1) ... [2023-11-19 07:34:13,090 INFO L138 Inliner]: procedures = 39, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 385 [2023-11-19 07:34:13,090 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:34:13,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:34:13,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:34:13,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:34:13,102 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:13" (1/1) ... [2023-11-19 07:34:13,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:13" (1/1) ... [2023-11-19 07:34:13,113 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:13" (1/1) ... [2023-11-19 07:34:13,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:13" (1/1) ... [2023-11-19 07:34:13,170 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:13" (1/1) ... [2023-11-19 07:34:13,186 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:13" (1/1) ... [2023-11-19 07:34:13,191 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:13" (1/1) ... [2023-11-19 07:34:13,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:13" (1/1) ... [2023-11-19 07:34:13,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:34:13,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:34:13,213 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:34:13,213 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:34:13,214 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:13" (1/1) ... [2023-11-19 07:34:13,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:34:13,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:34:13,254 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/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:34:13,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/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:34:13,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:34:13,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2023-11-19 07:34:13,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2023-11-19 07:34:13,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-19 07:34:13,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-11-19 07:34:13,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 07:34:13,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-19 07:34:13,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-11-19 07:34:13,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2023-11-19 07:34:13,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-19 07:34:13,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-11-19 07:34:13,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2023-11-19 07:34:13,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-11-19 07:34:13,308 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:34:13,308 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:34:13,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:34:13,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:34:13,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-19 07:34:13,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-11-19 07:34:13,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-19 07:34:13,494 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:34:13,497 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:34:18,804 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:34:18,814 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:34:18,814 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:34:18,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:34:18 BoogieIcfgContainer [2023-11-19 07:34:18,818 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:34:18,821 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:34:18,821 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:34:18,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:34:18,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:34:12" (1/3) ... [2023-11-19 07:34:18,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ad437f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:34:18, skipping insertion in model container [2023-11-19 07:34:18,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:13" (2/3) ... [2023-11-19 07:34:18,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ad437f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:34:18, skipping insertion in model container [2023-11-19 07:34:18,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:34:18" (3/3) ... [2023-11-19 07:34:18,828 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-55.i [2023-11-19 07:34:18,847 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:34:18,847 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:34:18,900 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:34:18,907 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;@4d3bd234, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:34:18,907 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:34:18,912 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:34:18,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-19 07:34:18,927 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:34:18,928 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:18,929 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:34:18,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:18,934 INFO L85 PathProgramCache]: Analyzing trace with hash -2007882332, now seen corresponding path program 1 times [2023-11-19 07:34:18,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:34:18,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020613711] [2023-11-19 07:34:18,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:18,950 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:34:18,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:34:18,951 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 07:34:18,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-19 07:34:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:19,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-19 07:34:19,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:34:19,757 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2023-11-19 07:34:19,757 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:34:19,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:34:19,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020613711] [2023-11-19 07:34:19,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020613711] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:19,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:19,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:34:19,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093128029] [2023-11-19 07:34:19,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:19,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:34:19,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:34:19,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:34:19,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:34:19,799 INFO L87 Difference]: Start difference. First operand has 99 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-19 07:34:19,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:34:19,830 INFO L93 Difference]: Finished difference Result 191 states and 298 transitions. [2023-11-19 07:34:19,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:34:19,833 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2023-11-19 07:34:19,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:34:19,840 INFO L225 Difference]: With dead ends: 191 [2023-11-19 07:34:19,840 INFO L226 Difference]: Without dead ends: 95 [2023-11-19 07:34:19,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 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:34:19,847 INFO L413 NwaCegarLoop]: 137 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, 137 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:34:19,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:34:19,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-19 07:34:19,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-11-19 07:34:19,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.3950617283950617) internal successors, (113), 81 states have internal predecessors, (113), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:34:19,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2023-11-19 07:34:19,897 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 113 [2023-11-19 07:34:19,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:34:19,898 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2023-11-19 07:34:19,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-19 07:34:19,899 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2023-11-19 07:34:19,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-19 07:34:19,905 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:34:19,905 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:19,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:34:20,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:34:20,106 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:34:20,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:20,107 INFO L85 PathProgramCache]: Analyzing trace with hash 104285460, now seen corresponding path program 1 times [2023-11-19 07:34:20,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:34:20,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526698810] [2023-11-19 07:34:20,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:20,109 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:34:20,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:34:20,111 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 07:34:20,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-19 07:34:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:20,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-19 07:34:20,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:34:20,961 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-19 07:34:20,966 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:34:20,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:34:20,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526698810] [2023-11-19 07:34:20,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526698810] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:20,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:20,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:34:20,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165501276] [2023-11-19 07:34:20,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:20,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:34:20,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:34:20,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:34:20,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:34:20,978 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-19 07:34:21,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:34:21,126 INFO L93 Difference]: Finished difference Result 193 states and 280 transitions. [2023-11-19 07:34:21,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:34:21,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2023-11-19 07:34:21,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:34:21,130 INFO L225 Difference]: With dead ends: 193 [2023-11-19 07:34:21,130 INFO L226 Difference]: Without dead ends: 101 [2023-11-19 07:34:21,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 110 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:34:21,133 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 10 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:34:21,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 396 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:34:21,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-19 07:34:21,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2023-11-19 07:34:21,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 83 states have internal predecessors, (115), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:34:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2023-11-19 07:34:21,154 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 113 [2023-11-19 07:34:21,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:34:21,155 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2023-11-19 07:34:21,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-19 07:34:21,156 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2023-11-19 07:34:21,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-19 07:34:21,158 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:34:21,159 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:21,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:34:21,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:34:21,382 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:34:21,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:21,383 INFO L85 PathProgramCache]: Analyzing trace with hash 836252886, now seen corresponding path program 1 times [2023-11-19 07:34:21,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:34:21,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328685097] [2023-11-19 07:34:21,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:21,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:34:21,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:34:21,387 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 07:34:21,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-19 07:34:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:22,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-19 07:34:22,046 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:34:22,125 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:34:22,125 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:34:22,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:34:22,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328685097] [2023-11-19 07:34:22,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328685097] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:22,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:22,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:34:22,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266583867] [2023-11-19 07:34:22,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:22,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:34:22,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:34:22,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:34:22,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:34:22,129 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:34:22,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:34:22,569 INFO L93 Difference]: Finished difference Result 212 states and 305 transitions. [2023-11-19 07:34:22,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:34:22,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-11-19 07:34:22,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:34:22,577 INFO L225 Difference]: With dead ends: 212 [2023-11-19 07:34:22,577 INFO L226 Difference]: Without dead ends: 118 [2023-11-19 07:34:22,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:34:22,583 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 46 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:34:22,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 520 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:34:22,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-19 07:34:22,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2023-11-19 07:34:22,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 87 states have (on average 1.367816091954023) internal successors, (119), 87 states have internal predecessors, (119), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:34:22,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2023-11-19 07:34:22,600 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 113 [2023-11-19 07:34:22,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:34:22,601 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2023-11-19 07:34:22,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:34:22,601 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2023-11-19 07:34:22,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-19 07:34:22,604 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:34:22,605 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:22,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-19 07:34:22,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:34:22,809 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:34:22,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:22,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1516311256, now seen corresponding path program 1 times [2023-11-19 07:34:22,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:34:22,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231370217] [2023-11-19 07:34:22,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:22,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:34:22,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:34:22,820 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 07:34:22,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-19 07:34:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:23,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 07:34:23,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:34:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:34:23,499 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:34:23,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:34:23,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231370217] [2023-11-19 07:34:23,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231370217] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:23,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:23,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:34:23,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266623010] [2023-11-19 07:34:23,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:23,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:34:23,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:34:23,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:34:23,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:34:23,505 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:34:23,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:34:23,919 INFO L93 Difference]: Finished difference Result 219 states and 310 transitions. [2023-11-19 07:34:23,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 07:34:23,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-11-19 07:34:23,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:34:23,922 INFO L225 Difference]: With dead ends: 219 [2023-11-19 07:34:23,922 INFO L226 Difference]: Without dead ends: 121 [2023-11-19 07:34:23,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:34:23,928 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 49 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:34:23,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 643 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:34:23,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-19 07:34:23,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 103. [2023-11-19 07:34:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:34:23,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2023-11-19 07:34:23,940 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 113 [2023-11-19 07:34:23,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:34:23,941 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2023-11-19 07:34:23,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:34:23,941 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2023-11-19 07:34:23,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-19 07:34:23,943 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:34:23,944 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:23,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-19 07:34:24,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:34:24,157 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:34:24,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:24,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1003648678, now seen corresponding path program 1 times [2023-11-19 07:34:24,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:34:24,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294988493] [2023-11-19 07:34:24,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:24,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:34:24,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:34:24,161 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 07:34:24,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-19 07:34:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:24,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 07:34:24,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:34:24,848 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:34:24,849 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:34:24,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:34:24,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294988493] [2023-11-19 07:34:24,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294988493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:24,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:24,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:34:24,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990634337] [2023-11-19 07:34:24,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:24,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:34:24,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:34:24,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:34:24,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:34:24,851 INFO L87 Difference]: Start difference. First operand 103 states and 145 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:34:25,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:34:25,421 INFO L93 Difference]: Finished difference Result 222 states and 310 transitions. [2023-11-19 07:34:25,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-19 07:34:25,421 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-11-19 07:34:25,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:34:25,423 INFO L225 Difference]: With dead ends: 222 [2023-11-19 07:34:25,423 INFO L226 Difference]: Without dead ends: 122 [2023-11-19 07:34:25,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2023-11-19 07:34:25,426 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 40 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:34:25,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 759 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:34:25,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-19 07:34:25,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 105. [2023-11-19 07:34:25,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 91 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:34:25,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2023-11-19 07:34:25,438 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 113 [2023-11-19 07:34:25,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:34:25,438 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2023-11-19 07:34:25,439 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:34:25,439 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2023-11-19 07:34:25,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-19 07:34:25,441 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:34:25,441 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:25,458 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-19 07:34:25,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:34:25,654 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:34:25,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:25,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1001801636, now seen corresponding path program 1 times [2023-11-19 07:34:25,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:34:25,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981782836] [2023-11-19 07:34:25,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:25,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:34:25,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:34:25,657 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 07:34:25,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3d5f486-923a-45df-a847-c5148169616f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-19 07:34:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:26,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-19 07:34:26,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:34:26,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:34:26,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2023-11-19 07:34:26,580 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-11-19 07:34:26,580 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:34:26,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:34:26,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981782836] [2023-11-19 07:34:26,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1981782836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:26,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:26,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:34:26,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020392211] [2023-11-19 07:34:26,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:26,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:34:26,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:34:26,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:34:26,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:34:26,584 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-19 07:34:29,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-19 07:34:31,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []