./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/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_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/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_280c424b-906d-4cb5-b677-64b3469d1ee5/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 0209c9293388eb915387172d6fa3be69dfb35a1de5258b69ac610130c33e2610 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:39:36,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:39:37,099 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:39:37,107 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:39:37,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:39:37,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:39:37,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:39:37,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:39:37,150 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:39:37,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:39:37,157 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:39:37,157 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:39:37,158 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:39:37,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:39:37,160 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:39:37,160 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:39:37,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:39:37,161 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:39:37,162 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:39:37,162 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:39:37,163 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:39:37,163 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:39:37,164 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:39:37,164 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:39:37,165 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:39:37,165 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:39:37,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:39:37,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:39:37,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:39:37,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:39:37,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:39:37,169 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:39:37,169 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:39:37,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:39:37,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:39:37,170 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:39:37,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:39:37,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:39:37,171 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:39:37,171 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_280c424b-906d-4cb5-b677-64b3469d1ee5/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_280c424b-906d-4cb5-b677-64b3469d1ee5/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 -> 0209c9293388eb915387172d6fa3be69dfb35a1de5258b69ac610130c33e2610 [2023-11-19 07:39:37,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:39:37,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:39:37,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:39:37,504 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:39:37,504 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:39:37,506 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c [2023-11-19 07:39:40,600 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:39:40,890 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:39:40,891 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c [2023-11-19 07:39:40,900 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/data/bf6cc22a1/e0f131daa5714d0cbae67578c1ff5337/FLAGd9eacbd3b [2023-11-19 07:39:40,919 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/data/bf6cc22a1/e0f131daa5714d0cbae67578c1ff5337 [2023-11-19 07:39:40,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:39:40,929 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:39:40,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:39:40,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:39:40,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:39:40,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:39:40" (1/1) ... [2023-11-19 07:39:40,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54cc795f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:40, skipping insertion in model container [2023-11-19 07:39:40,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:39:40" (1/1) ... [2023-11-19 07:39:40,971 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:39:41,174 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_280c424b-906d-4cb5-b677-64b3469d1ee5/sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c[964,977] [2023-11-19 07:39:41,183 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:39:41,197 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:39:41,215 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_280c424b-906d-4cb5-b677-64b3469d1ee5/sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c[964,977] [2023-11-19 07:39:41,217 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:39:41,233 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:39:41,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:41 WrapperNode [2023-11-19 07:39:41,234 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:39:41,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:39:41,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:39:41,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:39:41,245 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:39:41" (1/1) ... [2023-11-19 07:39:41,254 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:39:41" (1/1) ... [2023-11-19 07:39:41,274 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 45 [2023-11-19 07:39:41,275 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:39:41,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:39:41,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:39:41,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:39:41,287 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:41" (1/1) ... [2023-11-19 07:39:41,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:41" (1/1) ... [2023-11-19 07:39:41,289 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:41" (1/1) ... [2023-11-19 07:39:41,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:41" (1/1) ... [2023-11-19 07:39:41,293 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:41" (1/1) ... [2023-11-19 07:39:41,296 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:41" (1/1) ... [2023-11-19 07:39:41,297 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:41" (1/1) ... [2023-11-19 07:39:41,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:41" (1/1) ... [2023-11-19 07:39:41,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:39:41,301 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:39:41,301 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:39:41,301 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:39:41,302 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:41" (1/1) ... [2023-11-19 07:39:41,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:39:41,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:39:41,334 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/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:39:41,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/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:39:41,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:39:41,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:39:41,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:39:41,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:39:41,449 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:39:41,451 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:39:41,641 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:39:41,648 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:39:41,648 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:39:41,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:39:41 BoogieIcfgContainer [2023-11-19 07:39:41,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:39:41,670 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:39:41,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:39:41,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:39:41,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:39:40" (1/3) ... [2023-11-19 07:39:41,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a857f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:39:41, skipping insertion in model container [2023-11-19 07:39:41,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:41" (2/3) ... [2023-11-19 07:39:41,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a857f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:39:41, skipping insertion in model container [2023-11-19 07:39:41,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:39:41" (3/3) ... [2023-11-19 07:39:41,677 INFO L112 eAbstractionObserver]: Analyzing ICFG Muller_Kahan.c.p+cfa-reducer.c [2023-11-19 07:39:41,701 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:39:41,702 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:39:41,766 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:39:41,774 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;@368cf8f8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:39:41,775 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:39:41,780 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:41,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 07:39:41,787 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:41,787 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:41,789 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:41,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:41,797 INFO L85 PathProgramCache]: Analyzing trace with hash 207177897, now seen corresponding path program 1 times [2023-11-19 07:39:41,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:41,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358023980] [2023-11-19 07:39:41,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:41,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:42,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:42,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:42,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358023980] [2023-11-19 07:39:42,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358023980] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:42,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:42,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:39:42,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924060100] [2023-11-19 07:39:42,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:42,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:39:42,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:42,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:39:42,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:39:42,143 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:42,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:42,171 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2023-11-19 07:39:42,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:39:42,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-19 07:39:42,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:42,187 INFO L225 Difference]: With dead ends: 24 [2023-11-19 07:39:42,187 INFO L226 Difference]: Without dead ends: 11 [2023-11-19 07:39:42,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:39:42,193 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:42,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:39:42,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-11-19 07:39:42,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-11-19 07:39:42,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:42,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2023-11-19 07:39:42,221 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2023-11-19 07:39:42,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:42,221 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2023-11-19 07:39:42,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:42,222 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2023-11-19 07:39:42,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 07:39:42,222 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:42,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:42,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:39:42,223 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:42,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:42,224 INFO L85 PathProgramCache]: Analyzing trace with hash 263819657, now seen corresponding path program 1 times [2023-11-19 07:39:42,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:42,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763693902] [2023-11-19 07:39:42,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:42,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:42,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:42,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763693902] [2023-11-19 07:39:42,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763693902] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:39:42,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481982886] [2023-11-19 07:39:42,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:42,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:39:42,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:39:42,295 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:39:42,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:39:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:42,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-19 07:39:42,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:39:42,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:42,435 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:39:42,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:42,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481982886] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:39:42,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:39:42,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-19 07:39:42,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745694067] [2023-11-19 07:39:42,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:39:42,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:39:42,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:42,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:39:42,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:39:42,467 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:42,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:42,483 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2023-11-19 07:39:42,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:39:42,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-19 07:39:42,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:42,484 INFO L225 Difference]: With dead ends: 21 [2023-11-19 07:39:42,484 INFO L226 Difference]: Without dead ends: 14 [2023-11-19 07:39:42,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:39:42,487 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:42,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:39:42,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-11-19 07:39:42,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-11-19 07:39:42,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:42,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2023-11-19 07:39:42,492 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2023-11-19 07:39:42,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:42,492 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2023-11-19 07:39:42,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:42,493 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2023-11-19 07:39:42,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 07:39:42,493 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:42,493 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:42,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:39:42,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:39:42,715 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:42,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:42,715 INFO L85 PathProgramCache]: Analyzing trace with hash 110395561, now seen corresponding path program 2 times [2023-11-19 07:39:42,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:42,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601805978] [2023-11-19 07:39:42,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:42,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:42,837 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-19 07:39:42,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:42,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601805978] [2023-11-19 07:39:42,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601805978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:42,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:42,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:39:42,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977492337] [2023-11-19 07:39:42,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:42,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:39:42,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:42,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:39:42,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:42,842 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:42,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:42,862 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2023-11-19 07:39:42,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:39:42,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-19 07:39:42,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:42,864 INFO L225 Difference]: With dead ends: 18 [2023-11-19 07:39:42,864 INFO L226 Difference]: Without dead ends: 14 [2023-11-19 07:39:42,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:39:42,866 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:42,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 27 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:39:42,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-11-19 07:39:42,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-11-19 07:39:42,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:42,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2023-11-19 07:39:42,871 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2023-11-19 07:39:42,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:42,871 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2023-11-19 07:39:42,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:42,872 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2023-11-19 07:39:42,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 07:39:42,872 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:42,873 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:42,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:39:42,873 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:42,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:42,874 INFO L85 PathProgramCache]: Analyzing trace with hash 127406222, now seen corresponding path program 1 times [2023-11-19 07:39:42,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:42,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283098601] [2023-11-19 07:39:42,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:42,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:42,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:42,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:42,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283098601] [2023-11-19 07:39:42,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283098601] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:39:42,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145729024] [2023-11-19 07:39:42,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:42,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:39:42,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:39:42,988 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:39:43,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:39:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:43,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 07:39:43,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:39:43,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:43,075 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:39:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:43,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145729024] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:39:43,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:39:43,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-19 07:39:43,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804360289] [2023-11-19 07:39:43,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:39:43,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-19 07:39:43,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:43,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-19 07:39:43,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:39:43,156 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:43,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:43,178 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2023-11-19 07:39:43,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 07:39:43,179 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-19 07:39:43,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:43,180 INFO L225 Difference]: With dead ends: 27 [2023-11-19 07:39:43,180 INFO L226 Difference]: Without dead ends: 20 [2023-11-19 07:39:43,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:39:43,183 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:43,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:39:43,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-19 07:39:43,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-19 07:39:43,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:43,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2023-11-19 07:39:43,188 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 12 [2023-11-19 07:39:43,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:43,189 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2023-11-19 07:39:43,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:43,189 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2023-11-19 07:39:43,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-19 07:39:43,190 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:43,191 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:43,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:39:43,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:39:43,404 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:43,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:43,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1352950926, now seen corresponding path program 2 times [2023-11-19 07:39:43,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:43,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021080251] [2023-11-19 07:39:43,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:43,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:43,661 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:43,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:43,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021080251] [2023-11-19 07:39:43,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021080251] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:39:43,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118218948] [2023-11-19 07:39:43,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 07:39:43,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:39:43,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:39:43,668 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:39:43,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 07:39:43,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 07:39:43,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:39:43,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-19 07:39:43,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:39:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:43,864 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:39:44,169 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:44,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118218948] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:39:44,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:39:44,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2023-11-19 07:39:44,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619945106] [2023-11-19 07:39:44,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:39:44,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-19 07:39:44,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:44,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-19 07:39:44,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2023-11-19 07:39:44,174 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:44,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:44,219 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2023-11-19 07:39:44,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-19 07:39:44,220 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-19 07:39:44,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:44,221 INFO L225 Difference]: With dead ends: 39 [2023-11-19 07:39:44,221 INFO L226 Difference]: Without dead ends: 32 [2023-11-19 07:39:44,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2023-11-19 07:39:44,224 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:44,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:39:44,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-19 07:39:44,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-19 07:39:44,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:44,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2023-11-19 07:39:44,231 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 18 [2023-11-19 07:39:44,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:44,231 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2023-11-19 07:39:44,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:44,232 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2023-11-19 07:39:44,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-19 07:39:44,233 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:44,233 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:44,265 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 07:39:44,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:39:44,456 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:44,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:44,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1095765134, now seen corresponding path program 3 times [2023-11-19 07:39:44,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:44,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13276929] [2023-11-19 07:39:44,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:44,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:45,228 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:45,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:45,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13276929] [2023-11-19 07:39:45,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13276929] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:39:45,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808172098] [2023-11-19 07:39:45,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 07:39:45,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:39:45,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:39:45,235 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:39:45,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 07:39:45,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2023-11-19 07:39:45,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:39:45,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-19 07:39:45,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:39:45,458 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:45,458 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:39:46,639 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:46,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808172098] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:39:46,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:39:46,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2023-11-19 07:39:46,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237267839] [2023-11-19 07:39:46,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:39:46,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-19 07:39:46,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:46,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-19 07:39:46,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2023-11-19 07:39:46,646 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 49 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:46,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:46,752 INFO L93 Difference]: Finished difference Result 63 states and 88 transitions. [2023-11-19 07:39:46,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-19 07:39:46,753 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-19 07:39:46,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:46,755 INFO L225 Difference]: With dead ends: 63 [2023-11-19 07:39:46,755 INFO L226 Difference]: Without dead ends: 56 [2023-11-19 07:39:46,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2023-11-19 07:39:46,758 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:46,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:46,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-19 07:39:46,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-11-19 07:39:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:46,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2023-11-19 07:39:46,768 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 30 [2023-11-19 07:39:46,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:46,768 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2023-11-19 07:39:46,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2023-11-19 07:39:46,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-19 07:39:46,772 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:46,772 INFO L195 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:46,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-19 07:39:46,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:39:46,990 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:46,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:46,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1745658738, now seen corresponding path program 4 times [2023-11-19 07:39:46,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:46,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785022643] [2023-11-19 07:39:46,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:46,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:49,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:49,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:49,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785022643] [2023-11-19 07:39:49,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785022643] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:39:49,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086947873] [2023-11-19 07:39:49,017 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-19 07:39:49,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:39:49,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:39:49,019 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:39:49,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-19 07:39:49,141 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-19 07:39:49,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:39:49,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-19 07:39:49,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:39:49,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:49,268 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:39:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:53,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086947873] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:39:53,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:39:53,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2023-11-19 07:39:53,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408416359] [2023-11-19 07:39:53,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:39:53,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2023-11-19 07:39:53,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:53,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2023-11-19 07:39:53,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2023-11-19 07:39:53,027 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 97 states, 97 states have (on average 1.0721649484536082) internal successors, (104), 97 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:53,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:39:53,284 INFO L93 Difference]: Finished difference Result 111 states and 160 transitions. [2023-11-19 07:39:53,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-11-19 07:39:53,285 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 1.0721649484536082) internal successors, (104), 97 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-11-19 07:39:53,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:39:53,294 INFO L225 Difference]: With dead ends: 111 [2023-11-19 07:39:53,294 INFO L226 Difference]: Without dead ends: 104 [2023-11-19 07:39:53,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2023-11-19 07:39:53,301 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:39:53,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:39:53,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-19 07:39:53,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-11-19 07:39:53,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:53,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2023-11-19 07:39:53,322 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 54 [2023-11-19 07:39:53,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:39:53,322 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2023-11-19 07:39:53,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 1.0721649484536082) internal successors, (104), 97 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:53,323 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2023-11-19 07:39:53,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-19 07:39:53,328 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:39:53,328 INFO L195 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:53,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-19 07:39:53,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-19 07:39:53,540 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:39:53,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:53,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1919548558, now seen corresponding path program 5 times [2023-11-19 07:39:53,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:53,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49660714] [2023-11-19 07:39:53,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:53,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:00,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:40:00,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:00,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49660714] [2023-11-19 07:40:00,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49660714] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:40:00,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890212465] [2023-11-19 07:40:00,607 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-19 07:40:00,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:40:00,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:40:00,609 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:40:00,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-19 07:40:00,865 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2023-11-19 07:40:00,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:40:00,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 96 conjunts are in the unsatisfiable core [2023-11-19 07:40:00,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:40:01,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:40:01,172 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:40:06,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:40:06,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890212465] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:40:06,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:40:06,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 103 [2023-11-19 07:40:06,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223384158] [2023-11-19 07:40:06,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:40:06,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2023-11-19 07:40:06,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:06,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2023-11-19 07:40:06,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2023-11-19 07:40:06,908 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand has 103 states, 103 states have (on average 1.0776699029126213) internal successors, (111), 103 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:07,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:07,118 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2023-11-19 07:40:07,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-11-19 07:40:07,119 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 1.0776699029126213) internal successors, (111), 103 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2023-11-19 07:40:07,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:07,122 INFO L225 Difference]: With dead ends: 117 [2023-11-19 07:40:07,122 INFO L226 Difference]: Without dead ends: 110 [2023-11-19 07:40:07,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 108 SyntacticMatches, 90 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4831 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2023-11-19 07:40:07,133 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:40:07,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:40:07,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-19 07:40:07,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-11-19 07:40:07,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.018348623853211) internal successors, (111), 109 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:07,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2023-11-19 07:40:07,152 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 102 [2023-11-19 07:40:07,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:07,156 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2023-11-19 07:40:07,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 1.0776699029126213) internal successors, (111), 103 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:07,156 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2023-11-19 07:40:07,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-19 07:40:07,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:07,163 INFO L195 NwaCegarLoop]: trace histogram [100, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:07,190 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-19 07:40:07,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:40:07,376 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:07,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:07,376 INFO L85 PathProgramCache]: Analyzing trace with hash -648720242, now seen corresponding path program 6 times [2023-11-19 07:40:07,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:07,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109189461] [2023-11-19 07:40:07,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:07,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:40:07,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:40:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:40:07,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:40:07,679 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:40:07,681 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 07:40:07,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:40:07,688 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 1] [2023-11-19 07:40:07,693 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:40:07,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:40:07 BoogieIcfgContainer [2023-11-19 07:40:07,853 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:40:07,854 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:40:07,854 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:40:07,855 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:40:07,856 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:39:41" (3/4) ... [2023-11-19 07:40:07,858 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 07:40:07,860 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:40:07,860 INFO L158 Benchmark]: Toolchain (without parser) took 26931.06ms. Allocated memory was 117.4MB in the beginning and 247.5MB in the end (delta: 130.0MB). Free memory was 74.1MB in the beginning and 98.3MB in the end (delta: -24.2MB). Peak memory consumption was 107.6MB. Max. memory is 16.1GB. [2023-11-19 07:40:07,861 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory is still 90.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:40:07,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.72ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 63.7MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-19 07:40:07,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.98ms. Allocated memory is still 117.4MB. Free memory was 63.3MB in the beginning and 62.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:40:07,862 INFO L158 Benchmark]: Boogie Preprocessor took 23.97ms. Allocated memory is still 117.4MB. Free memory was 62.0MB in the beginning and 60.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:40:07,863 INFO L158 Benchmark]: RCFGBuilder took 366.33ms. Allocated memory is still 117.4MB. Free memory was 60.8MB in the beginning and 51.9MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-19 07:40:07,863 INFO L158 Benchmark]: TraceAbstraction took 26182.51ms. Allocated memory was 117.4MB in the beginning and 247.5MB in the end (delta: 130.0MB). Free memory was 51.1MB in the beginning and 98.3MB in the end (delta: -47.2MB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. [2023-11-19 07:40:07,864 INFO L158 Benchmark]: Witness Printer took 6.17ms. Allocated memory is still 247.5MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:40:07,869 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 117.4MB. Free memory is still 90.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.72ms. Allocated memory is still 117.4MB. Free memory was 74.1MB in the beginning and 63.7MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.98ms. Allocated memory is still 117.4MB. Free memory was 63.3MB in the beginning and 62.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.97ms. Allocated memory is still 117.4MB. Free memory was 62.0MB in the beginning and 60.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 366.33ms. Allocated memory is still 117.4MB. Free memory was 60.8MB in the beginning and 51.9MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 26182.51ms. Allocated memory was 117.4MB in the beginning and 247.5MB in the end (delta: 130.0MB). Free memory was 51.1MB in the beginning and 98.3MB in the end (delta: -47.2MB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. * Witness Printer took 6.17ms. Allocated memory is still 247.5MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 41]: 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 28, overapproximation of someBinaryArithmeticDOUBLEoperation at line 19. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L9] double main__x0; [L10] double main__x1; [L11] double main__x2; [L12] int main__i; [L13] main__x0 = 5.5 [L14] main__x1 = 5.545454545454546 [L15] main__i = 0 VAL [__return_main=0, main__i=0, main__x0=11/2, main__x1=2772727272727273/500000000000000] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=1, main__x0=2772727272727273/500000000000000, main__x1=143, main__x2=143] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=2, main__x0=143, main__x1=117, main__x2=117] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=3, main__x0=117, main__x1=115, main__x2=115] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=4, main__x0=115, main__x1=110, main__x2=110] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=5, main__x0=110, main__x1=167, main__x2=167] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=6, main__x0=167, main__x1=198, main__x2=198] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=7, main__x0=198, main__x1=180, main__x2=180] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=8, main__x0=180, main__x1=154, main__x2=154] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=9, main__x0=154, main__x1=118, main__x2=118] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=10, main__x0=118, main__x1=135, main__x2=135] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=11, main__x0=135, main__x1=145, main__x2=145] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=12, main__x0=145, main__x1=161, main__x2=161] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=13, main__x0=161, main__x1=182, main__x2=182] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=14, main__x0=182, main__x1=109, main__x2=109] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=15, main__x0=109, main__x1=157, main__x2=157] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=16, main__x0=157, main__x1=156, main__x2=156] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=17, main__x0=156, main__x1=138, main__x2=138] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=18, main__x0=138, main__x1=136, main__x2=136] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=19, main__x0=136, main__x1=155, main__x2=155] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=20, main__x0=155, main__x1=140, main__x2=140] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=21, main__x0=140, main__x1=124, main__x2=124] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=22, main__x0=124, main__x1=128, main__x2=128] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=23, main__x0=128, main__x1=196, main__x2=196] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=24, main__x0=196, main__x1=144, main__x2=144] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=25, main__x0=144, main__x1=119, main__x2=119] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=26, main__x0=119, main__x1=108, main__x2=108] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=27, main__x0=108, main__x1=111, main__x2=111] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=28, main__x0=111, main__x1=195, main__x2=195] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=29, main__x0=195, main__x1=176, main__x2=176] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=30, main__x0=176, main__x1=146, main__x2=146] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=31, main__x0=146, main__x1=187, main__x2=187] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=32, main__x0=187, main__x1=171, main__x2=171] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=33, main__x0=171, main__x1=168, main__x2=168] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=34, main__x0=168, main__x1=139, main__x2=139] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=35, main__x0=139, main__x1=120, main__x2=120] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=36, main__x0=120, main__x1=185, main__x2=185] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=37, main__x0=185, main__x1=192, main__x2=192] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=38, main__x0=192, main__x1=197, main__x2=197] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=39, main__x0=197, main__x1=159, main__x2=159] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=40, main__x0=159, main__x1=116, main__x2=116] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=41, main__x0=116, main__x1=179, main__x2=179] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=42, main__x0=179, main__x1=162, main__x2=162] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=43, main__x0=162, main__x1=148, main__x2=148] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=44, main__x0=148, main__x1=199, main__x2=199] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=45, main__x0=199, main__x1=106, main__x2=106] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=46, main__x0=106, main__x1=160, main__x2=160] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=47, main__x0=160, main__x1=189, main__x2=189] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=48, main__x0=189, main__x1=125, main__x2=125] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=49, main__x0=125, main__x1=188, main__x2=188] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=50, main__x0=188, main__x1=123, main__x2=123] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=51, main__x0=123, main__x1=130, main__x2=130] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=52, main__x0=130, main__x1=181, main__x2=181] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=53, main__x0=181, main__x1=121, main__x2=121] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=54, main__x0=121, main__x1=165, main__x2=165] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=55, main__x0=165, main__x1=191, main__x2=191] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=56, main__x0=191, main__x1=173, main__x2=173] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=57, main__x0=173, main__x1=151, main__x2=151] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=58, main__x0=151, main__x1=152, main__x2=152] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=59, main__x0=152, main__x1=153, main__x2=153] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=60, main__x0=153, main__x1=170, main__x2=170] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=61, main__x0=170, main__x1=174, main__x2=174] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=62, main__x0=174, main__x1=184, main__x2=184] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=63, main__x0=184, main__x1=127, main__x2=127] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=64, main__x0=127, main__x1=190, main__x2=190] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=65, main__x0=190, main__x1=112, main__x2=112] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=66, main__x0=112, main__x1=193, main__x2=193] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=67, main__x0=193, main__x1=126, main__x2=126] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=68, main__x0=126, main__x1=183, main__x2=183] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=69, main__x0=183, main__x1=107, main__x2=107] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=70, main__x0=107, main__x1=194, main__x2=194] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=71, main__x0=194, main__x1=200, main__x2=200] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=72, main__x0=200, main__x1=169, main__x2=169] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=73, main__x0=169, main__x1=142, main__x2=142] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=74, main__x0=142, main__x1=147, main__x2=147] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=75, main__x0=147, main__x1=149, main__x2=149] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=76, main__x0=149, main__x1=133, main__x2=133] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=77, main__x0=133, main__x1=201, main__x2=201] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=78, main__x0=201, main__x1=202, main__x2=202] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=79, main__x0=202, main__x1=186, main__x2=186] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=80, main__x0=186, main__x1=175, main__x2=175] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=81, main__x0=175, main__x1=166, main__x2=166] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=82, main__x0=166, main__x1=134, main__x2=134] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=83, main__x0=134, main__x1=163, main__x2=163] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=84, main__x0=163, main__x1=164, main__x2=164] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=85, main__x0=164, main__x1=178, main__x2=178] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=86, main__x0=178, main__x1=131, main__x2=131] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=87, main__x0=131, main__x1=114, main__x2=114] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=88, main__x0=114, main__x1=113, main__x2=113] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=89, main__x0=113, main__x1=122, main__x2=122] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=90, main__x0=122, main__x1=132, main__x2=132] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=91, main__x0=132, main__x1=177, main__x2=177] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=92, main__x0=177, main__x1=141, main__x2=141] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=93, main__x0=141, main__x1=105, main__x2=105] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=94, main__x0=105, main__x1=150, main__x2=150] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=95, main__x0=150, main__x1=204, main__x2=204] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=96, main__x0=204, main__x1=158, main__x2=158] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=97, main__x0=158, main__x1=129, main__x2=129] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=98, main__x0=129, main__x1=137, main__x2=137] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=99, main__x0=137, main__x1=203, main__x2=203] [L17] COND TRUE main__i < 100 [L19] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L20] main__x0 = main__x1 [L21] main__x1 = main__x2 [L22] main__i = main__i + 1 VAL [__return_main=0, main__i=100, main__x0=203, main__x1=172, main__x2=172] [L17] COND FALSE !(main__i < 100) [L27] int main____CPAchecker_TMP_0; VAL [__return_main=0, main__i=100, main__x0=203, main__x1=172, main__x2=172] [L28] COND FALSE !(main__x0 >= 99.0) VAL [__return_main=0, main__i=100, main__x0=203, main__x1=172, main__x2=172] [L53] main____CPAchecker_TMP_0 = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=0, main__i=100, main__x0=203, main__x1=172, main__x2=172] [L35] int __tmp_1; [L36] __tmp_1 = main____CPAchecker_TMP_0 [L37] int __VERIFIER_assert__cond; [L38] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_main=0, __tmp_1=0, main____CPAchecker_TMP_0=0, main__i=100, main__x0=203, main__x1=172, main__x2=172] [L39] COND TRUE __VERIFIER_assert__cond == 0 VAL [__VERIFIER_assert__cond=0, __return_main=0, __tmp_1=0, main____CPAchecker_TMP_0=0, main__i=100, main__x0=203, main__x1=172, main__x2=172] [L41] reach_error() VAL [__VERIFIER_assert__cond=0, __return_main=0, __tmp_1=0, main____CPAchecker_TMP_0=0, main__i=100, main__x0=203, main__x1=172, main__x2=172] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.9s, OverallIterations: 9, TraceHistogramMax: 100, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 323 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 237 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 323 IncrementalHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 86 mSDtfsCounter, 323 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 641 GetRequests, 265 SyntacticMatches, 90 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5163 ImplicationChecksByTransitivity, 16.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=8, InterpolantAutomatonStates: 295, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 22.0s InterpolantComputationTime, 578 NumberOfCodeBlocks, 578 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 675 ConstructedInterpolants, 0 QuantifiedInterpolants, 1779 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1480 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 10/17605 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:40:07,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/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_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/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_280c424b-906d-4cb5-b677-64b3469d1ee5/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 0209c9293388eb915387172d6fa3be69dfb35a1de5258b69ac610130c33e2610 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:40:10,694 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:40:10,858 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-19 07:40:10,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:40:10,869 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:40:10,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:40:10,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:40:10,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:40:10,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:40:10,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:40:10,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:40:10,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:40:10,907 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:40:10,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:40:10,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:40:10,909 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:40:10,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:40:10,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:40:10,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:40:10,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:40:10,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:40:10,914 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:40:10,914 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 07:40:10,915 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 07:40:10,915 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:40:10,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:40:10,916 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:40:10,917 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:40:10,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:40:10,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:40:10,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:40:10,919 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:40:10,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:40:10,920 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:40:10,920 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-19 07:40:10,920 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 07:40:10,921 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:40:10,921 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:40:10,921 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:40:10,921 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:40:10,922 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-19 07:40:10,922 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:40:10,922 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_280c424b-906d-4cb5-b677-64b3469d1ee5/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_280c424b-906d-4cb5-b677-64b3469d1ee5/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 -> 0209c9293388eb915387172d6fa3be69dfb35a1de5258b69ac610130c33e2610 [2023-11-19 07:40:11,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:40:11,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:40:11,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:40:11,481 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:40:11,483 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:40:11,485 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c [2023-11-19 07:40:14,835 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:40:15,218 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:40:15,220 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c [2023-11-19 07:40:15,231 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/data/7620698ba/6b9a20bd5d5d4baea0265d85d5411627/FLAGaaf4d68d0 [2023-11-19 07:40:15,262 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/data/7620698ba/6b9a20bd5d5d4baea0265d85d5411627 [2023-11-19 07:40:15,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:40:15,273 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:40:15,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:40:15,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:40:15,283 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:40:15,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:40:15" (1/1) ... [2023-11-19 07:40:15,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4680e95a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:15, skipping insertion in model container [2023-11-19 07:40:15,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:40:15" (1/1) ... [2023-11-19 07:40:15,316 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:40:15,572 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_280c424b-906d-4cb5-b677-64b3469d1ee5/sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c[964,977] [2023-11-19 07:40:15,581 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:40:15,605 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:40:15,634 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_280c424b-906d-4cb5-b677-64b3469d1ee5/sv-benchmarks/c/float-benchs/Muller_Kahan.c.p+cfa-reducer.c[964,977] [2023-11-19 07:40:15,636 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:40:15,665 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:40:15,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:15 WrapperNode [2023-11-19 07:40:15,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:40:15,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:40:15,669 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:40:15,669 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:40:15,679 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:40:15" (1/1) ... [2023-11-19 07:40:15,694 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:40:15" (1/1) ... [2023-11-19 07:40:15,719 INFO L138 Inliner]: procedures = 13, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2023-11-19 07:40:15,719 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:40:15,720 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:40:15,721 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:40:15,721 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:40:15,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:15" (1/1) ... [2023-11-19 07:40:15,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:15" (1/1) ... [2023-11-19 07:40:15,750 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:15" (1/1) ... [2023-11-19 07:40:15,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:15" (1/1) ... [2023-11-19 07:40:15,766 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:15" (1/1) ... [2023-11-19 07:40:15,771 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:15" (1/1) ... [2023-11-19 07:40:15,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:15" (1/1) ... [2023-11-19 07:40:15,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:15" (1/1) ... [2023-11-19 07:40:15,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:40:15,790 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:40:15,790 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:40:15,791 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:40:15,792 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:15" (1/1) ... [2023-11-19 07:40:15,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:40:15,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:40:15,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/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:40:15,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/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:40:15,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:40:15,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:40:15,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:40:15,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 07:40:15,998 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:40:16,001 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:40:18,906 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:40:18,929 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:40:18,929 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:40:18,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:40:18 BoogieIcfgContainer [2023-11-19 07:40:18,936 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:40:18,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:40:18,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:40:18,952 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:40:18,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:40:15" (1/3) ... [2023-11-19 07:40:18,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f13655b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:40:18, skipping insertion in model container [2023-11-19 07:40:18,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:15" (2/3) ... [2023-11-19 07:40:18,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f13655b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:40:18, skipping insertion in model container [2023-11-19 07:40:18,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:40:18" (3/3) ... [2023-11-19 07:40:18,958 INFO L112 eAbstractionObserver]: Analyzing ICFG Muller_Kahan.c.p+cfa-reducer.c [2023-11-19 07:40:18,989 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:40:18,989 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:40:19,047 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:40:19,054 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;@61b93baa, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:40:19,054 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:40:19,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:19,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 07:40:19,064 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:19,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:19,066 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:19,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:19,072 INFO L85 PathProgramCache]: Analyzing trace with hash 207177897, now seen corresponding path program 1 times [2023-11-19 07:40:19,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:40:19,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208264451] [2023-11-19 07:40:19,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:19,088 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:40:19,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:40:19,090 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/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:40:19,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/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:40:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:19,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-19 07:40:19,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:40:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:40:19,340 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:40:19,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:40:19,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208264451] [2023-11-19 07:40:19,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208264451] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:19,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:19,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:40:19,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327058640] [2023-11-19 07:40:19,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:19,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:40:19,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:40:19,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:40:19,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:40:19,388 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:22,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-19 07:40:24,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-19 07:40:26,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-19 07:40:26,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:26,818 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2023-11-19 07:40:26,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:40:26,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-19 07:40:26,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:26,830 INFO L225 Difference]: With dead ends: 24 [2023-11-19 07:40:26,830 INFO L226 Difference]: Without dead ends: 11 [2023-11-19 07:40:26,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:40:26,837 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:40:26,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 3 Unknown, 0 Unchecked, 7.4s Time] [2023-11-19 07:40:26,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-11-19 07:40:26,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-11-19 07:40:26,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2023-11-19 07:40:26,870 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2023-11-19 07:40:26,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:26,871 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2023-11-19 07:40:26,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:26,872 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2023-11-19 07:40:26,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 07:40:26,872 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:26,873 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:26,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/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:40:27,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/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:40:27,076 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:27,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:27,077 INFO L85 PathProgramCache]: Analyzing trace with hash 263819657, now seen corresponding path program 1 times [2023-11-19 07:40:27,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:40:27,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603664909] [2023-11-19 07:40:27,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:27,078 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:40:27,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:40:27,080 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/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:40:27,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_280c424b-906d-4cb5-b677-64b3469d1ee5/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:40:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:28,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-19 07:40:28,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:40:29,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:40:29,296 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:40:29,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:40:29,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:40:29,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603664909] [2023-11-19 07:40:29,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603664909] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:40:29,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:40:29,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-11-19 07:40:29,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068837085] [2023-11-19 07:40:29,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:40:29,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:40:29,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:40:29,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:40:29,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:40:29,688 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)