./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 16:29:31,984 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 16:29:31,985 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 16:29:31,991 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 16:29:31,991 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 16:29:31,991 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 16:29:31,992 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 16:29:31,993 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 16:29:31,993 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 16:29:31,994 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 16:29:31,994 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 16:29:31,994 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 16:29:31,995 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 16:29:31,995 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 16:29:31,996 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 16:29:31,996 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 16:29:31,996 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 16:29:31,997 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 16:29:31,998 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 16:29:31,999 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 16:29:31,999 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 16:29:32,000 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 16:29:32,001 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 16:29:32,001 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 16:29:32,001 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 16:29:32,001 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 16:29:32,002 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 16:29:32,002 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 16:29:32,003 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 16:29:32,003 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 16:29:32,003 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 16:29:32,004 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 16:29:32,004 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 16:29:32,004 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 16:29:32,004 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 16:29:32,004 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 16:29:32,005 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 16:29:32,012 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 16:29:32,012 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 16:29:32,012 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 16:29:32,013 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 16:29:32,013 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 16:29:32,013 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 16:29:32,013 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 16:29:32,013 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 16:29:32,013 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 16:29:32,013 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 16:29:32,013 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 16:29:32,013 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 16:29:32,013 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 16:29:32,014 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 16:29:32,014 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 16:29:32,014 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 16:29:32,014 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 16:29:32,014 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 16:29:32,014 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 16:29:32,014 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 16:29:32,015 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 16:29:32,015 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 16:29:32,015 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 16:29:32,015 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 16:29:32,015 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 16:29:32,015 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 16:29:32,015 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 16:29:32,015 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 16:29:32,015 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 16:29:32,015 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 16:29:32,015 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 16:29:32,016 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 16:29:32,016 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 16:29:32,016 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 16:29:32,016 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 16:29:32,016 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 16:29:32,016 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2018-12-09 16:29:32,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 16:29:32,039 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 16:29:32,041 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 16:29:32,042 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 16:29:32,042 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 16:29:32,043 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-09 16:29:32,077 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/data/3441ed004/c86b039607f342e99ea8d55d5b14d26d/FLAG687f5f5e4 [2018-12-09 16:29:32,516 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 16:29:32,516 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-09 16:29:32,522 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/data/3441ed004/c86b039607f342e99ea8d55d5b14d26d/FLAG687f5f5e4 [2018-12-09 16:29:32,530 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/data/3441ed004/c86b039607f342e99ea8d55d5b14d26d [2018-12-09 16:29:32,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 16:29:32,533 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 16:29:32,533 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 16:29:32,533 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 16:29:32,535 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 16:29:32,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:29:32" (1/1) ... [2018-12-09 16:29:32,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ee621a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:29:32, skipping insertion in model container [2018-12-09 16:29:32,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:29:32" (1/1) ... [2018-12-09 16:29:32,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 16:29:32,562 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 16:29:32,707 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:29:32,713 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 16:29:32,778 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:29:32,799 INFO L195 MainTranslator]: Completed translation [2018-12-09 16:29:32,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:29:32 WrapperNode [2018-12-09 16:29:32,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 16:29:32,800 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 16:29:32,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 16:29:32,800 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 16:29:32,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:29:32" (1/1) ... [2018-12-09 16:29:32,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:29:32" (1/1) ... [2018-12-09 16:29:32,817 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 16:29:32,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 16:29:32,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 16:29:32,817 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 16:29:32,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:29:32" (1/1) ... [2018-12-09 16:29:32,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:29:32" (1/1) ... [2018-12-09 16:29:32,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:29:32" (1/1) ... [2018-12-09 16:29:32,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:29:32" (1/1) ... [2018-12-09 16:29:32,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:29:32" (1/1) ... [2018-12-09 16:29:32,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:29:32" (1/1) ... [2018-12-09 16:29:32,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:29:32" (1/1) ... [2018-12-09 16:29:32,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 16:29:32,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 16:29:32,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 16:29:32,839 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 16:29:32,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:29:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 16:29:32,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 16:29:32,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 16:29:32,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 16:29:32,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 16:29:32,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 16:29:32,870 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 16:29:32,870 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 16:29:32,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 16:29:32,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 16:29:32,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 16:29:32,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 16:29:32,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 16:29:33,172 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 16:29:33,172 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-09 16:29:33,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:29:33 BoogieIcfgContainer [2018-12-09 16:29:33,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 16:29:33,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 16:29:33,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 16:29:33,175 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 16:29:33,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:29:32" (1/3) ... [2018-12-09 16:29:33,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66606b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:29:33, skipping insertion in model container [2018-12-09 16:29:33,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:29:32" (2/3) ... [2018-12-09 16:29:33,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66606b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:29:33, skipping insertion in model container [2018-12-09 16:29:33,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:29:33" (3/3) ... [2018-12-09 16:29:33,176 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-09 16:29:33,182 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 16:29:33,187 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-12-09 16:29:33,195 INFO L257 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2018-12-09 16:29:33,210 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 16:29:33,210 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 16:29:33,210 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 16:29:33,210 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 16:29:33,210 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 16:29:33,210 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 16:29:33,210 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 16:29:33,210 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 16:29:33,220 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2018-12-09 16:29:33,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-09 16:29:33,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:33,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:33,228 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION]=== [2018-12-09 16:29:33,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:33,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1288008672, now seen corresponding path program 1 times [2018-12-09 16:29:33,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:29:33,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:33,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:33,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:33,268 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:29:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:33,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:33,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:29:33,328 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:29:33,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:29:33,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:29:33,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:29:33,340 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 3 states. [2018-12-09 16:29:33,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:33,466 INFO L93 Difference]: Finished difference Result 171 states and 178 transitions. [2018-12-09 16:29:33,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:29:33,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-09 16:29:33,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:33,475 INFO L225 Difference]: With dead ends: 171 [2018-12-09 16:29:33,475 INFO L226 Difference]: Without dead ends: 167 [2018-12-09 16:29:33,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:29:33,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-09 16:29:33,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 143. [2018-12-09 16:29:33,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-09 16:29:33,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 148 transitions. [2018-12-09 16:29:33,505 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 148 transitions. Word has length 7 [2018-12-09 16:29:33,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:33,505 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 148 transitions. [2018-12-09 16:29:33,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:29:33,505 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 148 transitions. [2018-12-09 16:29:33,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-09 16:29:33,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:33,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:33,506 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION]=== [2018-12-09 16:29:33,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:33,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1288008673, now seen corresponding path program 1 times [2018-12-09 16:29:33,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:29:33,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:33,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:33,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:33,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:29:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:33,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:33,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:33,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:29:33,539 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:29:33,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:29:33,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:29:33,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:29:33,541 INFO L87 Difference]: Start difference. First operand 143 states and 148 transitions. Second operand 3 states. [2018-12-09 16:29:33,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:33,608 INFO L93 Difference]: Finished difference Result 140 states and 145 transitions. [2018-12-09 16:29:33,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:29:33,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-09 16:29:33,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:33,609 INFO L225 Difference]: With dead ends: 140 [2018-12-09 16:29:33,609 INFO L226 Difference]: Without dead ends: 140 [2018-12-09 16:29:33,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:29:33,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-09 16:29:33,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-12-09 16:29:33,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-09 16:29:33,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 145 transitions. [2018-12-09 16:29:33,614 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 145 transitions. Word has length 7 [2018-12-09 16:29:33,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:33,614 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 145 transitions. [2018-12-09 16:29:33,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:29:33,614 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 145 transitions. [2018-12-09 16:29:33,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 16:29:33,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:33,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:33,615 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION]=== [2018-12-09 16:29:33,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:33,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1021398364, now seen corresponding path program 1 times [2018-12-09 16:29:33,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:29:33,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:33,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:33,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:33,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:29:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:33,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:33,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:33,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:29:33,639 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:29:33,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:29:33,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:29:33,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:29:33,640 INFO L87 Difference]: Start difference. First operand 140 states and 145 transitions. Second operand 3 states. [2018-12-09 16:29:33,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:33,716 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2018-12-09 16:29:33,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:29:33,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 16:29:33,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:33,717 INFO L225 Difference]: With dead ends: 139 [2018-12-09 16:29:33,717 INFO L226 Difference]: Without dead ends: 139 [2018-12-09 16:29:33,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:29:33,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-09 16:29:33,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-12-09 16:29:33,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-09 16:29:33,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2018-12-09 16:29:33,723 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 11 [2018-12-09 16:29:33,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:33,723 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2018-12-09 16:29:33,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:29:33,723 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2018-12-09 16:29:33,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 16:29:33,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:33,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:33,724 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION]=== [2018-12-09 16:29:33,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:33,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1021398363, now seen corresponding path program 1 times [2018-12-09 16:29:33,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:29:33,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:33,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:33,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:33,725 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:29:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:33,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:33,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:33,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:29:33,750 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:29:33,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:29:33,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:29:33,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:29:33,751 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand 3 states. [2018-12-09 16:29:33,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:33,822 INFO L93 Difference]: Finished difference Result 148 states and 154 transitions. [2018-12-09 16:29:33,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:29:33,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 16:29:33,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:33,824 INFO L225 Difference]: With dead ends: 148 [2018-12-09 16:29:33,824 INFO L226 Difference]: Without dead ends: 148 [2018-12-09 16:29:33,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:29:33,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-09 16:29:33,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 139. [2018-12-09 16:29:33,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-09 16:29:33,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 146 transitions. [2018-12-09 16:29:33,830 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 146 transitions. Word has length 11 [2018-12-09 16:29:33,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:33,831 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 146 transitions. [2018-12-09 16:29:33,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:29:33,831 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 146 transitions. [2018-12-09 16:29:33,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 16:29:33,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:33,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:33,832 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION]=== [2018-12-09 16:29:33,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:33,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1511446413, now seen corresponding path program 1 times [2018-12-09 16:29:33,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:29:33,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:33,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:33,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:33,834 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:29:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:33,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:33,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:33,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:29:33,880 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:29:33,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:29:33,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:29:33,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:29:33,881 INFO L87 Difference]: Start difference. First operand 139 states and 146 transitions. Second operand 4 states. [2018-12-09 16:29:33,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:33,982 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-12-09 16:29:33,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:29:33,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-09 16:29:33,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:33,983 INFO L225 Difference]: With dead ends: 140 [2018-12-09 16:29:33,983 INFO L226 Difference]: Without dead ends: 140 [2018-12-09 16:29:33,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:29:33,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-09 16:29:33,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 126. [2018-12-09 16:29:33,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-09 16:29:33,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-12-09 16:29:33,986 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 17 [2018-12-09 16:29:33,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:33,986 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-12-09 16:29:33,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:29:33,986 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-12-09 16:29:33,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 16:29:33,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:33,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:33,987 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION]=== [2018-12-09 16:29:33,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:33,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1511446414, now seen corresponding path program 1 times [2018-12-09 16:29:33,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:29:33,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:33,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:33,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:33,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:29:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:34,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:34,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:34,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:29:34,022 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:29:34,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:29:34,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:29:34,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:29:34,022 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 4 states. [2018-12-09 16:29:34,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:34,157 INFO L93 Difference]: Finished difference Result 160 states and 170 transitions. [2018-12-09 16:29:34,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 16:29:34,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-09 16:29:34,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:34,159 INFO L225 Difference]: With dead ends: 160 [2018-12-09 16:29:34,159 INFO L226 Difference]: Without dead ends: 160 [2018-12-09 16:29:34,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:29:34,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-09 16:29:34,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 135. [2018-12-09 16:29:34,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-09 16:29:34,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2018-12-09 16:29:34,164 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 17 [2018-12-09 16:29:34,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:34,164 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2018-12-09 16:29:34,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:29:34,164 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2018-12-09 16:29:34,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 16:29:34,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:34,165 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:34,165 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION]=== [2018-12-09 16:29:34,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:34,166 INFO L82 PathProgramCache]: Analyzing trace with hash 801057136, now seen corresponding path program 1 times [2018-12-09 16:29:34,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:29:34,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:34,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:34,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:34,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:29:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:34,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:34,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:34,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:29:34,212 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:29:34,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:29:34,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:29:34,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:29:34,213 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand 5 states. [2018-12-09 16:29:34,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:34,351 INFO L93 Difference]: Finished difference Result 177 states and 193 transitions. [2018-12-09 16:29:34,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:29:34,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-09 16:29:34,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:34,352 INFO L225 Difference]: With dead ends: 177 [2018-12-09 16:29:34,352 INFO L226 Difference]: Without dead ends: 177 [2018-12-09 16:29:34,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:29:34,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-09 16:29:34,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 134. [2018-12-09 16:29:34,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-09 16:29:34,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2018-12-09 16:29:34,355 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 19 [2018-12-09 16:29:34,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:34,355 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2018-12-09 16:29:34,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:29:34,355 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2018-12-09 16:29:34,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 16:29:34,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:34,355 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:34,356 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION]=== [2018-12-09 16:29:34,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:34,356 INFO L82 PathProgramCache]: Analyzing trace with hash 801057137, now seen corresponding path program 1 times [2018-12-09 16:29:34,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:29:34,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:34,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:34,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:34,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:29:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:34,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:34,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:29:34,395 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:29:34,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:29:34,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:29:34,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:29:34,396 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand 5 states. [2018-12-09 16:29:34,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:34,548 INFO L93 Difference]: Finished difference Result 198 states and 215 transitions. [2018-12-09 16:29:34,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:29:34,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-09 16:29:34,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:34,549 INFO L225 Difference]: With dead ends: 198 [2018-12-09 16:29:34,549 INFO L226 Difference]: Without dead ends: 198 [2018-12-09 16:29:34,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 16:29:34,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-09 16:29:34,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 133. [2018-12-09 16:29:34,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-09 16:29:34,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2018-12-09 16:29:34,552 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 19 [2018-12-09 16:29:34,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:34,552 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2018-12-09 16:29:34,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:29:34,552 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2018-12-09 16:29:34,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 16:29:34,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:34,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:34,553 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION]=== [2018-12-09 16:29:34,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:34,553 INFO L82 PathProgramCache]: Analyzing trace with hash -2144075406, now seen corresponding path program 1 times [2018-12-09 16:29:34,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:29:34,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:34,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:34,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:34,554 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:29:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:34,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:34,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:34,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 16:29:34,624 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:29:34,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 16:29:34,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 16:29:34,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 16:29:34,624 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand 9 states. [2018-12-09 16:29:34,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:34,885 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2018-12-09 16:29:34,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 16:29:34,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-12-09 16:29:34,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:34,886 INFO L225 Difference]: With dead ends: 145 [2018-12-09 16:29:34,886 INFO L226 Difference]: Without dead ends: 145 [2018-12-09 16:29:34,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-12-09 16:29:34,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-09 16:29:34,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2018-12-09 16:29:34,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-09 16:29:34,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2018-12-09 16:29:34,888 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 23 [2018-12-09 16:29:34,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:34,888 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2018-12-09 16:29:34,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 16:29:34,888 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2018-12-09 16:29:34,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 16:29:34,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:34,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:34,889 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION]=== [2018-12-09 16:29:34,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:34,889 INFO L82 PathProgramCache]: Analyzing trace with hash -2144075405, now seen corresponding path program 1 times [2018-12-09 16:29:34,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:29:34,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:34,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:34,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:34,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:29:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:34,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:34,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:34,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 16:29:34,977 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:29:34,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 16:29:34,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 16:29:34,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 16:29:34,978 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand 10 states. [2018-12-09 16:29:35,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:35,426 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2018-12-09 16:29:35,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 16:29:35,427 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-12-09 16:29:35,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:35,427 INFO L225 Difference]: With dead ends: 156 [2018-12-09 16:29:35,427 INFO L226 Difference]: Without dead ends: 156 [2018-12-09 16:29:35,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-12-09 16:29:35,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-12-09 16:29:35,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 134. [2018-12-09 16:29:35,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-09 16:29:35,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2018-12-09 16:29:35,430 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 23 [2018-12-09 16:29:35,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:35,430 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2018-12-09 16:29:35,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 16:29:35,430 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2018-12-09 16:29:35,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 16:29:35,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:35,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:35,431 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION]=== [2018-12-09 16:29:35,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:35,432 INFO L82 PathProgramCache]: Analyzing trace with hash -2060363479, now seen corresponding path program 1 times [2018-12-09 16:29:35,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:29:35,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:35,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:35,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:35,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:29:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:35,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:35,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 16:29:35,458 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:29:35,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:29:35,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:29:35,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:29:35,459 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand 6 states. [2018-12-09 16:29:35,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:35,596 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2018-12-09 16:29:35,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 16:29:35,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-09 16:29:35,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:35,597 INFO L225 Difference]: With dead ends: 159 [2018-12-09 16:29:35,597 INFO L226 Difference]: Without dead ends: 159 [2018-12-09 16:29:35,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-12-09 16:29:35,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-09 16:29:35,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2018-12-09 16:29:35,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-09 16:29:35,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2018-12-09 16:29:35,600 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 26 [2018-12-09 16:29:35,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:35,601 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2018-12-09 16:29:35,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:29:35,601 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2018-12-09 16:29:35,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 16:29:35,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:35,602 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:35,602 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION]=== [2018-12-09 16:29:35,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:35,602 INFO L82 PathProgramCache]: Analyzing trace with hash -875183104, now seen corresponding path program 1 times [2018-12-09 16:29:35,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:29:35,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:35,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:35,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:35,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:29:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:35,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:35,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:29:35,667 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:29:35,667 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-12-09 16:29:35,668 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [15], [16], [19], [22], [25], [30], [33], [141], [149], [153], [160], [167], [171], [183], [184], [185], [229], [231], [234], [285], [286], [287] [2018-12-09 16:29:35,688 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:29:35,688 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:29:35,777 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:29:35,777 INFO L272 AbstractInterpreter]: Visited 28 different actions 28 times. Never merged. Never widened. Performed 192 root evaluator evaluations with a maximum evaluation depth of 3. Performed 192 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-12-09 16:29:35,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:35,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:29:35,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:29:35,783 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:29:35,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:35,790 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:29:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:35,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:29:35,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 16:29:35,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 16:29:35,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:35,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:35,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 16:29:35,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 16:29:35,852 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:35,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:35,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:35,860 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-12-09 16:29:35,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-12-09 16:29:35,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:35,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 16:29:35,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:35,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:35,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-12-09 16:29:35,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:35,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 16:29:35,898 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:35,902 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:35,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:35,915 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:33 [2018-12-09 16:29:35,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-12-09 16:29:35,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:35,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:35,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:35,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-12-09 16:29:35,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:35,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:35,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-12-09 16:29:35,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:35,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:35,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:35,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-12-09 16:29:35,961 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:35,966 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:35,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:35,970 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:33 [2018-12-09 16:29:35,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-09 16:29:35,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:35,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-09 16:29:35,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:35,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:36,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-09 16:29:36,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:36,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-09 16:29:36,003 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:36,010 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:36,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:36,016 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-12-09 16:29:36,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:36,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:29:36,048 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:36,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:36,064 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:36,068 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:36,077 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:36,078 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:36,094 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:36,096 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:36,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 16:29:36,098 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:107, output treesize:25 [2018-12-09 16:29:36,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:36,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:29:36,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 8 [2018-12-09 16:29:36,125 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:29:36,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 16:29:36,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 16:29:36,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 16:29:36,126 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand 8 states. [2018-12-09 16:29:36,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:36,386 INFO L93 Difference]: Finished difference Result 190 states and 203 transitions. [2018-12-09 16:29:36,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 16:29:36,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-12-09 16:29:36,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:36,387 INFO L225 Difference]: With dead ends: 190 [2018-12-09 16:29:36,387 INFO L226 Difference]: Without dead ends: 190 [2018-12-09 16:29:36,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 11 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-09 16:29:36,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-09 16:29:36,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 148. [2018-12-09 16:29:36,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-09 16:29:36,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2018-12-09 16:29:36,391 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 29 [2018-12-09 16:29:36,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:36,391 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2018-12-09 16:29:36,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 16:29:36,392 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2018-12-09 16:29:36,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 16:29:36,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:36,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:36,393 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION]=== [2018-12-09 16:29:36,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:36,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1749861147, now seen corresponding path program 1 times [2018-12-09 16:29:36,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:29:36,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:36,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:36,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:36,394 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:29:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:36,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:36,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:29:36,465 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:29:36,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:29:36,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:29:36,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:29:36,466 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. Second operand 5 states. [2018-12-09 16:29:36,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:36,576 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-12-09 16:29:36,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:29:36,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-09 16:29:36,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:36,577 INFO L225 Difference]: With dead ends: 151 [2018-12-09 16:29:36,577 INFO L226 Difference]: Without dead ends: 151 [2018-12-09 16:29:36,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:29:36,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-09 16:29:36,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2018-12-09 16:29:36,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-09 16:29:36,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2018-12-09 16:29:36,580 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 30 [2018-12-09 16:29:36,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:36,580 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2018-12-09 16:29:36,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:29:36,580 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2018-12-09 16:29:36,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 16:29:36,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:36,581 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:36,581 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION]=== [2018-12-09 16:29:36,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:36,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1205351030, now seen corresponding path program 1 times [2018-12-09 16:29:36,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:29:36,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:36,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:36,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:36,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:29:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:36,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:36,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:36,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:29:36,616 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:29:36,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:29:36,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:29:36,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:29:36,617 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand 5 states. [2018-12-09 16:29:36,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:36,761 INFO L93 Difference]: Finished difference Result 210 states and 224 transitions. [2018-12-09 16:29:36,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:29:36,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-09 16:29:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:36,762 INFO L225 Difference]: With dead ends: 210 [2018-12-09 16:29:36,762 INFO L226 Difference]: Without dead ends: 210 [2018-12-09 16:29:36,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:29:36,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-09 16:29:36,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 146. [2018-12-09 16:29:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-09 16:29:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions. [2018-12-09 16:29:36,771 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 30 [2018-12-09 16:29:36,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:36,771 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions. [2018-12-09 16:29:36,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:29:36,771 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2018-12-09 16:29:36,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 16:29:36,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:36,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:36,772 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION]=== [2018-12-09 16:29:36,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:36,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1205351029, now seen corresponding path program 1 times [2018-12-09 16:29:36,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:29:36,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:36,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:36,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:36,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:29:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:36,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:36,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:36,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:29:36,832 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:29:36,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:29:36,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:29:36,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:29:36,832 INFO L87 Difference]: Start difference. First operand 146 states and 155 transitions. Second operand 5 states. [2018-12-09 16:29:36,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:36,986 INFO L93 Difference]: Finished difference Result 231 states and 247 transitions. [2018-12-09 16:29:36,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:29:36,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-09 16:29:36,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:36,987 INFO L225 Difference]: With dead ends: 231 [2018-12-09 16:29:36,987 INFO L226 Difference]: Without dead ends: 231 [2018-12-09 16:29:36,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 16:29:36,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-12-09 16:29:36,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 145. [2018-12-09 16:29:36,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-09 16:29:36,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2018-12-09 16:29:36,990 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 30 [2018-12-09 16:29:36,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:36,990 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2018-12-09 16:29:36,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:29:36,990 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2018-12-09 16:29:36,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 16:29:36,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:36,990 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:36,991 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION]=== [2018-12-09 16:29:36,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:36,991 INFO L82 PathProgramCache]: Analyzing trace with hash 762632254, now seen corresponding path program 1 times [2018-12-09 16:29:36,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:29:36,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:36,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:36,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:36,991 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:29:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:29:37,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:37,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 16:29:37,039 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:29:37,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:29:37,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:29:37,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:29:37,040 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand 6 states. [2018-12-09 16:29:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:37,151 INFO L93 Difference]: Finished difference Result 158 states and 166 transitions. [2018-12-09 16:29:37,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 16:29:37,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-12-09 16:29:37,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:37,152 INFO L225 Difference]: With dead ends: 158 [2018-12-09 16:29:37,152 INFO L226 Difference]: Without dead ends: 158 [2018-12-09 16:29:37,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-09 16:29:37,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-09 16:29:37,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 145. [2018-12-09 16:29:37,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-09 16:29:37,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions. [2018-12-09 16:29:37,154 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 31 [2018-12-09 16:29:37,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:37,155 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 153 transitions. [2018-12-09 16:29:37,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:29:37,155 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2018-12-09 16:29:37,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 16:29:37,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:37,155 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:37,155 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION]=== [2018-12-09 16:29:37,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:37,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1658380276, now seen corresponding path program 1 times [2018-12-09 16:29:37,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:29:37,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:37,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:37,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:37,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:29:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:37,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:37,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:37,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 16:29:37,217 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:29:37,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 16:29:37,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 16:29:37,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 16:29:37,218 INFO L87 Difference]: Start difference. First operand 145 states and 153 transitions. Second operand 8 states. [2018-12-09 16:29:37,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:37,420 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2018-12-09 16:29:37,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 16:29:37,420 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-12-09 16:29:37,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:37,420 INFO L225 Difference]: With dead ends: 145 [2018-12-09 16:29:37,420 INFO L226 Difference]: Without dead ends: 145 [2018-12-09 16:29:37,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-12-09 16:29:37,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-09 16:29:37,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2018-12-09 16:29:37,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-09 16:29:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2018-12-09 16:29:37,424 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 34 [2018-12-09 16:29:37,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:37,424 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2018-12-09 16:29:37,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 16:29:37,424 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2018-12-09 16:29:37,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 16:29:37,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:37,425 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:37,425 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION]=== [2018-12-09 16:29:37,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:37,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1658380275, now seen corresponding path program 1 times [2018-12-09 16:29:37,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:29:37,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:37,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:37,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:37,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:29:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:37,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:37,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:37,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 16:29:37,527 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:29:37,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 16:29:37,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 16:29:37,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 16:29:37,527 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 9 states. [2018-12-09 16:29:37,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:37,933 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-12-09 16:29:37,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 16:29:37,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-12-09 16:29:37,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:37,935 INFO L225 Difference]: With dead ends: 140 [2018-12-09 16:29:37,935 INFO L226 Difference]: Without dead ends: 140 [2018-12-09 16:29:37,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-12-09 16:29:37,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-09 16:29:37,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2018-12-09 16:29:37,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-09 16:29:37,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-12-09 16:29:37,938 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 34 [2018-12-09 16:29:37,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:37,939 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-12-09 16:29:37,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 16:29:37,939 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-12-09 16:29:37,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 16:29:37,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:37,939 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:37,940 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION]=== [2018-12-09 16:29:37,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:37,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1359456605, now seen corresponding path program 1 times [2018-12-09 16:29:37,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:29:37,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:37,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:37,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:37,942 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:29:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:38,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:38,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:29:38,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:29:38,003 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-12-09 16:29:38,003 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [15], [16], [19], [22], [25], [30], [33], [141], [149], [153], [160], [167], [171], [181], [183], [184], [229], [231], [234], [245], [246], [251], [252], [255], [257], [259], [261], [285], [286], [287] [2018-12-09 16:29:38,005 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:29:38,005 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:29:38,052 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:29:38,052 INFO L272 AbstractInterpreter]: Visited 36 different actions 36 times. Never merged. Never widened. Performed 232 root evaluator evaluations with a maximum evaluation depth of 3. Performed 232 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 34 variables. [2018-12-09 16:29:38,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:38,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:29:38,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:29:38,053 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:29:38,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:38,061 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:29:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:38,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:29:38,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 16:29:38,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 16:29:38,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:38,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:38,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:38,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 16:29:38,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 16:29:38,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-09 16:29:38,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:38,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:38,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:38,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-09 16:29:38,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:29:38,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:29:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:29:38,147 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 16:29:38,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 9 [2018-12-09 16:29:38,147 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:29:38,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:29:38,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:29:38,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 16:29:38,148 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 4 states. [2018-12-09 16:29:38,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:38,187 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2018-12-09 16:29:38,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 16:29:38,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-12-09 16:29:38,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:38,188 INFO L225 Difference]: With dead ends: 130 [2018-12-09 16:29:38,188 INFO L226 Difference]: Without dead ends: 130 [2018-12-09 16:29:38,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-09 16:29:38,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-09 16:29:38,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 125. [2018-12-09 16:29:38,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-09 16:29:38,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2018-12-09 16:29:38,190 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 36 [2018-12-09 16:29:38,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:38,190 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2018-12-09 16:29:38,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:29:38,191 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2018-12-09 16:29:38,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 16:29:38,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:38,191 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:38,191 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION]=== [2018-12-09 16:29:38,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:38,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1478819748, now seen corresponding path program 1 times [2018-12-09 16:29:38,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:29:38,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:38,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:38,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:38,193 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:29:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:38,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:38,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:29:38,298 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:29:38,298 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-12-09 16:29:38,298 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [15], [16], [19], [22], [25], [30], [33], [141], [149], [153], [160], [167], [171], [181], [183], [184], [229], [231], [234], [245], [246], [247], [269], [270], [273], [275], [277], [285], [286], [287] [2018-12-09 16:29:38,299 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:29:38,299 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:29:38,345 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:29:38,345 INFO L272 AbstractInterpreter]: Visited 36 different actions 42 times. Merged at 6 different actions 6 times. Never widened. Performed 296 root evaluator evaluations with a maximum evaluation depth of 3. Performed 296 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 34 variables. [2018-12-09 16:29:38,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:38,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:29:38,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:29:38,347 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:29:38,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:38,356 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:29:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:38,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:29:38,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-12-09 16:29:38,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-09 16:29:38,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:38,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:38,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-12-09 16:29:38,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-09 16:29:38,391 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:38,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:38,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:38,393 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:3 [2018-12-09 16:29:38,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 16:29:38,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 16:29:38,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:38,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:38,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 16:29:38,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 16:29:38,455 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:38,456 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:38,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:38,460 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:10 [2018-12-09 16:29:38,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:38,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:29:38,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:38,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:29:38,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 10] total 20 [2018-12-09 16:29:38,596 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:29:38,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 16:29:38,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 16:29:38,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-12-09 16:29:38,597 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 14 states. [2018-12-09 16:29:38,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:38,889 INFO L93 Difference]: Finished difference Result 162 states and 171 transitions. [2018-12-09 16:29:38,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 16:29:38,890 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-12-09 16:29:38,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:38,890 INFO L225 Difference]: With dead ends: 162 [2018-12-09 16:29:38,890 INFO L226 Difference]: Without dead ends: 162 [2018-12-09 16:29:38,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2018-12-09 16:29:38,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-09 16:29:38,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 135. [2018-12-09 16:29:38,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-09 16:29:38,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2018-12-09 16:29:38,893 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 37 [2018-12-09 16:29:38,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:38,893 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2018-12-09 16:29:38,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 16:29:38,893 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2018-12-09 16:29:38,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 16:29:38,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:38,894 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:38,894 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION]=== [2018-12-09 16:29:38,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:38,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1401227515, now seen corresponding path program 1 times [2018-12-09 16:29:38,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:29:38,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:38,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:38,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:29:38,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:29:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 16:29:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 16:29:38,918 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 16:29:38,927 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-09 16:29:38,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:29:38 BoogieIcfgContainer [2018-12-09 16:29:38,940 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 16:29:38,941 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 16:29:38,941 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 16:29:38,941 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 16:29:38,941 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:29:33" (3/4) ... [2018-12-09 16:29:38,944 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 16:29:38,944 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 16:29:38,944 INFO L168 Benchmark]: Toolchain (without parser) took 6411.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.7 MB). Free memory was 948.1 MB in the beginning and 957.8 MB in the end (delta: -9.7 MB). Peak memory consumption was 179.0 MB. Max. memory is 11.5 GB. [2018-12-09 16:29:38,945 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:29:38,945 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -153.9 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-12-09 16:29:38,946 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 16:29:38,946 INFO L168 Benchmark]: Boogie Preprocessor took 21.56 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:29:38,946 INFO L168 Benchmark]: RCFGBuilder took 333.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. [2018-12-09 16:29:38,947 INFO L168 Benchmark]: TraceAbstraction took 5767.73 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.0 GB in the beginning and 957.8 MB in the end (delta: 91.1 MB). Peak memory consumption was 167.2 MB. Max. memory is 11.5 GB. [2018-12-09 16:29:38,947 INFO L168 Benchmark]: Witness Printer took 3.24 ms. Allocated memory is still 1.2 GB. Free memory is still 957.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:29:38,949 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 266.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -153.9 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.56 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 333.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5767.73 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.0 GB in the beginning and 957.8 MB in the end (delta: 91.1 MB). Peak memory consumption was 167.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.24 ms. Allocated memory is still 1.2 GB. Free memory is still 957.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 985. Possible FailurePath: [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); VAL [malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L988] null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L989] null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L990] null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L993] list->next = null VAL [list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L994] list->prev = null VAL [list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L995] list->colour = BLACK VAL [list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L997] struct TSLL* end = list; VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1031] EXPR end->colour VAL [end={19:0}, end->colour=1, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE null != end VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1034] EXPR end->colour VAL [end={19:0}, end->colour=1, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next VAL [end={19:0}, end->next={20:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1041] end = end->next [L1032] COND FALSE !(null != end) VAL [end={20:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1045] COND TRUE null != list VAL [end={20:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1047] EXPR list->colour VAL [end={20:0}, list={19:0}, list->colour=1, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1047] COND FALSE !(RED == list->colour) [L1056] EXPR list->next VAL [end={20:0}, list={19:0}, list->next={20:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1056] end = list->next [L1057] free(list) VAL [end={20:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1057] free(list) [L1058] list = end VAL [end={20:0}, list={20:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1045] COND FALSE !(null != list) VAL [end={20:0}, list={20:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L1062] return 0; VAL [\result=0, end={20:0}, list={20:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={20:0}, null={20:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 149 locations, 67 error locations. UNSAFE Result, 5.7s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1736 SDtfs, 2572 SDslu, 3134 SDs, 0 SdLazy, 4829 SolverSat, 223 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 370 GetRequests, 198 SyntacticMatches, 25 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 504 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 611 NumberOfCodeBlocks, 611 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 649 ConstructedInterpolants, 0 QuantifiedInterpolants, 132555 SizeOfPredicates, 35 NumberOfNonLiveVariables, 480 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 26 InterpolantComputations, 19 PerfectInterpolantSequences, 9/19 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-09 16:29:40,235 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 16:29:40,236 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 16:29:40,242 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 16:29:40,242 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 16:29:40,242 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 16:29:40,243 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 16:29:40,244 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 16:29:40,245 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 16:29:40,245 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 16:29:40,245 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 16:29:40,246 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 16:29:40,246 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 16:29:40,247 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 16:29:40,247 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 16:29:40,248 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 16:29:40,248 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 16:29:40,249 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 16:29:40,250 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 16:29:40,250 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 16:29:40,251 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 16:29:40,252 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 16:29:40,253 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 16:29:40,253 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 16:29:40,253 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 16:29:40,253 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 16:29:40,254 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 16:29:40,254 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 16:29:40,255 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 16:29:40,255 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 16:29:40,255 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 16:29:40,256 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 16:29:40,256 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 16:29:40,256 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 16:29:40,257 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 16:29:40,257 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 16:29:40,257 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-09 16:29:40,264 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 16:29:40,265 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 16:29:40,265 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 16:29:40,265 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 16:29:40,265 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 16:29:40,266 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 16:29:40,266 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 16:29:40,266 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 16:29:40,266 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 16:29:40,266 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 16:29:40,267 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 16:29:40,267 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 16:29:40,267 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 16:29:40,267 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 16:29:40,267 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 16:29:40,267 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 16:29:40,267 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 16:29:40,267 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 16:29:40,268 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 16:29:40,268 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 16:29:40,268 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 16:29:40,268 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 16:29:40,268 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 16:29:40,268 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 16:29:40,268 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 16:29:40,268 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 16:29:40,269 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 16:29:40,269 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 16:29:40,269 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 16:29:40,269 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 16:29:40,269 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 16:29:40,269 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 16:29:40,269 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 16:29:40,270 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 16:29:40,270 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 16:29:40,270 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 16:29:40,270 INFO L133 SettingsManager]: * Logic for external solver=AUFBV 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-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2018-12-09 16:29:40,288 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 16:29:40,298 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 16:29:40,300 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 16:29:40,301 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 16:29:40,302 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 16:29:40,302 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-09 16:29:40,343 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/data/1c23a58a7/ba0e06b02e524549be9e72dfa0d70643/FLAGea22768fa [2018-12-09 16:29:40,765 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 16:29:40,765 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-09 16:29:40,771 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/data/1c23a58a7/ba0e06b02e524549be9e72dfa0d70643/FLAGea22768fa [2018-12-09 16:29:40,779 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/data/1c23a58a7/ba0e06b02e524549be9e72dfa0d70643 [2018-12-09 16:29:40,781 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 16:29:40,782 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 16:29:40,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 16:29:40,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 16:29:40,784 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 16:29:40,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:29:40" (1/1) ... [2018-12-09 16:29:40,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d4440c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:29:40, skipping insertion in model container [2018-12-09 16:29:40,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:29:40" (1/1) ... [2018-12-09 16:29:40,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 16:29:40,809 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 16:29:40,960 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:29:40,968 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 16:29:41,033 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:29:41,055 INFO L195 MainTranslator]: Completed translation [2018-12-09 16:29:41,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:29:41 WrapperNode [2018-12-09 16:29:41,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 16:29:41,055 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 16:29:41,055 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 16:29:41,056 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 16:29:41,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:29:41" (1/1) ... [2018-12-09 16:29:41,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:29:41" (1/1) ... [2018-12-09 16:29:41,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 16:29:41,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 16:29:41,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 16:29:41,075 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 16:29:41,081 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:29:41" (1/1) ... [2018-12-09 16:29:41,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:29:41" (1/1) ... [2018-12-09 16:29:41,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:29:41" (1/1) ... [2018-12-09 16:29:41,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:29:41" (1/1) ... [2018-12-09 16:29:41,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:29:41" (1/1) ... [2018-12-09 16:29:41,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:29:41" (1/1) ... [2018-12-09 16:29:41,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:29:41" (1/1) ... [2018-12-09 16:29:41,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 16:29:41,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 16:29:41,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 16:29:41,100 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 16:29:41,100 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:29:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 16:29:41,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 16:29:41,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-09 16:29:41,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 16:29:41,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 16:29:41,132 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 16:29:41,132 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 16:29:41,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 16:29:41,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 16:29:41,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 16:29:41,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-09 16:29:41,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 16:29:41,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 16:29:41,587 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 16:29:41,587 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-09 16:29:41,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:29:41 BoogieIcfgContainer [2018-12-09 16:29:41,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 16:29:41,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 16:29:41,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 16:29:41,590 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 16:29:41,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:29:40" (1/3) ... [2018-12-09 16:29:41,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e8bf136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:29:41, skipping insertion in model container [2018-12-09 16:29:41,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:29:41" (2/3) ... [2018-12-09 16:29:41,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e8bf136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:29:41, skipping insertion in model container [2018-12-09 16:29:41,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:29:41" (3/3) ... [2018-12-09 16:29:41,592 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-09 16:29:41,597 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 16:29:41,602 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-12-09 16:29:41,611 INFO L257 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2018-12-09 16:29:41,625 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 16:29:41,626 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 16:29:41,626 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 16:29:41,626 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 16:29:41,626 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 16:29:41,626 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 16:29:41,627 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 16:29:41,627 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 16:29:41,627 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 16:29:41,638 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2018-12-09 16:29:41,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-09 16:29:41,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:41,643 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:41,645 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-12-09 16:29:41,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:41,648 INFO L82 PathProgramCache]: Analyzing trace with hash -487060194, now seen corresponding path program 1 times [2018-12-09 16:29:41,650 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:29:41,650 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:29:41,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:41,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:29:41,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:29:41,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:41,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:41,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 16:29:41,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:41,733 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:29:41,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:41,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:29:41,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:29:41,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:29:41,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:29:41,746 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 3 states. [2018-12-09 16:29:42,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:42,032 INFO L93 Difference]: Finished difference Result 169 states and 176 transitions. [2018-12-09 16:29:42,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:29:42,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-09 16:29:42,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:42,041 INFO L225 Difference]: With dead ends: 169 [2018-12-09 16:29:42,041 INFO L226 Difference]: Without dead ends: 165 [2018-12-09 16:29:42,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:29:42,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-09 16:29:42,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 141. [2018-12-09 16:29:42,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-09 16:29:42,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 146 transitions. [2018-12-09 16:29:42,068 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 146 transitions. Word has length 7 [2018-12-09 16:29:42,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:42,069 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 146 transitions. [2018-12-09 16:29:42,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:29:42,069 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 146 transitions. [2018-12-09 16:29:42,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-09 16:29:42,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:42,069 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:42,070 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-12-09 16:29:42,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:42,070 INFO L82 PathProgramCache]: Analyzing trace with hash -487060193, now seen corresponding path program 1 times [2018-12-09 16:29:42,070 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:29:42,071 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:29:42,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:42,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:29:42,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:29:42,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:42,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:42,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 16:29:42,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:42,126 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:29:42,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:42,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:29:42,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:29:42,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:29:42,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:29:42,129 INFO L87 Difference]: Start difference. First operand 141 states and 146 transitions. Second operand 3 states. [2018-12-09 16:29:42,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:42,366 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2018-12-09 16:29:42,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:29:42,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-09 16:29:42,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:42,368 INFO L225 Difference]: With dead ends: 138 [2018-12-09 16:29:42,368 INFO L226 Difference]: Without dead ends: 138 [2018-12-09 16:29:42,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:29:42,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-09 16:29:42,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-12-09 16:29:42,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-09 16:29:42,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2018-12-09 16:29:42,375 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 7 [2018-12-09 16:29:42,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:42,375 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2018-12-09 16:29:42,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:29:42,375 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2018-12-09 16:29:42,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 16:29:42,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:42,376 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:42,376 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-12-09 16:29:42,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:42,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1606843618, now seen corresponding path program 1 times [2018-12-09 16:29:42,377 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:29:42,377 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:29:42,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:42,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:29:42,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 16:29:42,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:42,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:42,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-09 16:29:42,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:42,447 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:29:42,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:42,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:29:42,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:29:42,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:29:42,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:29:42,449 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand 4 states. [2018-12-09 16:29:42,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:42,676 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2018-12-09 16:29:42,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 16:29:42,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-09 16:29:42,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:42,677 INFO L225 Difference]: With dead ends: 137 [2018-12-09 16:29:42,677 INFO L226 Difference]: Without dead ends: 137 [2018-12-09 16:29:42,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:29:42,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-09 16:29:42,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2018-12-09 16:29:42,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-09 16:29:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2018-12-09 16:29:42,684 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 11 [2018-12-09 16:29:42,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:42,684 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2018-12-09 16:29:42,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:29:42,685 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2018-12-09 16:29:42,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 16:29:42,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:42,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:42,686 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-12-09 16:29:42,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:42,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1606843619, now seen corresponding path program 1 times [2018-12-09 16:29:42,686 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:29:42,686 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:29:42,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:42,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:29:42,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:29:42,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:42,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:42,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 16:29:42,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:42,747 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:29:42,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:42,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:29:42,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:29:42,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:29:42,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:29:42,749 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand 3 states. [2018-12-09 16:29:42,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:42,996 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-12-09 16:29:42,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:29:42,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 16:29:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:42,997 INFO L225 Difference]: With dead ends: 146 [2018-12-09 16:29:42,997 INFO L226 Difference]: Without dead ends: 146 [2018-12-09 16:29:42,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:29:42,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-09 16:29:43,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 137. [2018-12-09 16:29:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-09 16:29:43,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-12-09 16:29:43,001 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 11 [2018-12-09 16:29:43,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:43,002 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-12-09 16:29:43,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:29:43,002 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-12-09 16:29:43,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 16:29:43,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:43,002 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:43,002 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-12-09 16:29:43,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:43,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1511028585, now seen corresponding path program 1 times [2018-12-09 16:29:43,003 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:29:43,003 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:29:43,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:43,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:29:43,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 16:29:43,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:43,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:43,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-09 16:29:43,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 16:29:43,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:43,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:43,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-09 16:29:43,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:43,117 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:29:43,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:43,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:29:43,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:29:43,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:29:43,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:29:43,119 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 5 states. [2018-12-09 16:29:43,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:43,405 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-12-09 16:29:43,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:29:43,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-09 16:29:43,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:43,406 INFO L225 Difference]: With dead ends: 138 [2018-12-09 16:29:43,406 INFO L226 Difference]: Without dead ends: 138 [2018-12-09 16:29:43,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:29:43,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-09 16:29:43,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 124. [2018-12-09 16:29:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-09 16:29:43,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2018-12-09 16:29:43,409 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 16 [2018-12-09 16:29:43,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:43,410 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2018-12-09 16:29:43,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:29:43,410 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2018-12-09 16:29:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 16:29:43,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:43,410 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:43,410 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-12-09 16:29:43,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:43,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1511028584, now seen corresponding path program 1 times [2018-12-09 16:29:43,411 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:29:43,411 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:29:43,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:43,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:29:43,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:29:43,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:43,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:29:43,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:43,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:43,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 16:29:43,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:43,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:43,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 16:29:43,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:43,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 16:29:43,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:43,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:43,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-12-09 16:29:43,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:43,582 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:29:43,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:43,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:29:43,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:29:43,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:29:43,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:29:43,585 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand 5 states. [2018-12-09 16:29:44,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:44,204 INFO L93 Difference]: Finished difference Result 153 states and 163 transitions. [2018-12-09 16:29:44,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:29:44,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-09 16:29:44,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:44,205 INFO L225 Difference]: With dead ends: 153 [2018-12-09 16:29:44,205 INFO L226 Difference]: Without dead ends: 153 [2018-12-09 16:29:44,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:29:44,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-09 16:29:44,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 132. [2018-12-09 16:29:44,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-09 16:29:44,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2018-12-09 16:29:44,208 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 16 [2018-12-09 16:29:44,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:44,208 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2018-12-09 16:29:44,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:29:44,208 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2018-12-09 16:29:44,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 16:29:44,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:44,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:44,209 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-12-09 16:29:44,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:44,209 INFO L82 PathProgramCache]: Analyzing trace with hash -399523878, now seen corresponding path program 1 times [2018-12-09 16:29:44,209 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:29:44,209 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:29:44,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:44,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:29:44,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:29:44,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:44,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:44,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 16:29:44,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 16:29:44,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 16:29:44,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:44,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:44,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:44,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-12-09 16:29:44,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 16:29:44,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-09 16:29:44,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:44,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:44,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:44,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2018-12-09 16:29:44,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:44,316 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:29:44,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:44,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:29:44,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:29:44,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:29:44,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:29:44,318 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand 5 states. [2018-12-09 16:29:44,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:44,799 INFO L93 Difference]: Finished difference Result 174 states and 190 transitions. [2018-12-09 16:29:44,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:29:44,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-09 16:29:44,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:44,800 INFO L225 Difference]: With dead ends: 174 [2018-12-09 16:29:44,800 INFO L226 Difference]: Without dead ends: 174 [2018-12-09 16:29:44,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:29:44,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-09 16:29:44,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 131. [2018-12-09 16:29:44,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-09 16:29:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2018-12-09 16:29:44,803 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 18 [2018-12-09 16:29:44,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:44,803 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2018-12-09 16:29:44,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:29:44,804 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2018-12-09 16:29:44,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 16:29:44,804 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:44,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:44,804 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-12-09 16:29:44,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:44,805 INFO L82 PathProgramCache]: Analyzing trace with hash -399523877, now seen corresponding path program 1 times [2018-12-09 16:29:44,805 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:29:44,805 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:29:44,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:44,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:29:44,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:29:44,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:44,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:44,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 16:29:44,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 16:29:44,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 16:29:44,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:44,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:44,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 16:29:44,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 16:29:44,920 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:44,924 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:44,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:44,931 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-12-09 16:29:44,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 16:29:44,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 16:29:44,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:44,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:44,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 16:29:44,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-09 16:29:44,956 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:44,957 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:44,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:44,961 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-12-09 16:29:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:44,969 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:29:44,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:44,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:29:44,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:29:44,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:29:44,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:29:44,972 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand 5 states. [2018-12-09 16:29:45,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:45,609 INFO L93 Difference]: Finished difference Result 195 states and 212 transitions. [2018-12-09 16:29:45,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:29:45,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-09 16:29:45,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:45,611 INFO L225 Difference]: With dead ends: 195 [2018-12-09 16:29:45,611 INFO L226 Difference]: Without dead ends: 195 [2018-12-09 16:29:45,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 16:29:45,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-09 16:29:45,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 130. [2018-12-09 16:29:45,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-09 16:29:45,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2018-12-09 16:29:45,615 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 18 [2018-12-09 16:29:45,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:45,615 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2018-12-09 16:29:45,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:29:45,615 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2018-12-09 16:29:45,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 16:29:45,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:45,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:45,616 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-12-09 16:29:45,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:45,616 INFO L82 PathProgramCache]: Analyzing trace with hash -935404900, now seen corresponding path program 1 times [2018-12-09 16:29:45,616 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:29:45,616 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:29:45,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:45,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:29:45,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 16:29:45,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:45,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:45,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-09 16:29:45,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:45,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:45,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 16:29:45,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:45,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:45,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-09 16:29:45,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 16:29:45,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 16:29:45,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:45,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:45,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:45,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-12-09 16:29:45,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-12-09 16:29:45,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-09 16:29:45,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:45,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:45,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:45,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-12-09 16:29:45,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-12-09 16:29:45,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-12-09 16:29:45,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:45,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 16:29:45,903 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:45,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:45,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:45,913 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-12-09 16:29:45,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:45,947 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:29:45,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:45,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 16:29:45,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 16:29:45,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 16:29:45,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-09 16:29:45,951 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand 11 states. [2018-12-09 16:29:47,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:47,164 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2018-12-09 16:29:47,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 16:29:47,164 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-12-09 16:29:47,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:47,165 INFO L225 Difference]: With dead ends: 176 [2018-12-09 16:29:47,165 INFO L226 Difference]: Without dead ends: 176 [2018-12-09 16:29:47,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2018-12-09 16:29:47,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-09 16:29:47,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 129. [2018-12-09 16:29:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-09 16:29:47,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2018-12-09 16:29:47,167 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 22 [2018-12-09 16:29:47,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:47,167 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2018-12-09 16:29:47,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 16:29:47,167 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2018-12-09 16:29:47,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 16:29:47,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:47,168 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:47,168 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-12-09 16:29:47,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:47,168 INFO L82 PathProgramCache]: Analyzing trace with hash -935404899, now seen corresponding path program 1 times [2018-12-09 16:29:47,168 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:29:47,168 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:29:47,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:47,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:29:47,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:29:47,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:47,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:47,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 16:29:47,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:47,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:47,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 16:29:47,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:47,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:29:47,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:47,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:47,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-12-09 16:29:47,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 16:29:47,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 16:29:47,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:47,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:47,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 16:29:47,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 16:29:47,367 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:47,369 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:47,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:47,377 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-12-09 16:29:47,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-09 16:29:47,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-09 16:29:47,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:47,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:47,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-12-09 16:29:47,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-09 16:29:47,470 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:47,482 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:47,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:47,497 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-12-09 16:29:47,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-12-09 16:29:47,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 16:29:47,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:47,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 16:29:47,563 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:47,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:47,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-12-09 16:29:47,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 16:29:47,593 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:47,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-09 16:29:47,601 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:47,605 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:47,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:47,609 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-12-09 16:29:47,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:47,640 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:29:47,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:47,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 16:29:47,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 16:29:47,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 16:29:47,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 16:29:47,642 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand 10 states. [2018-12-09 16:29:48,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:48,991 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2018-12-09 16:29:48,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 16:29:48,992 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-12-09 16:29:48,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:48,993 INFO L225 Difference]: With dead ends: 152 [2018-12-09 16:29:48,993 INFO L226 Difference]: Without dead ends: 152 [2018-12-09 16:29:48,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2018-12-09 16:29:48,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-09 16:29:48,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 131. [2018-12-09 16:29:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-09 16:29:48,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2018-12-09 16:29:48,995 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 22 [2018-12-09 16:29:48,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:48,995 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2018-12-09 16:29:48,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 16:29:48,995 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2018-12-09 16:29:48,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 16:29:48,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:48,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:48,996 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-12-09 16:29:48,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:48,996 INFO L82 PathProgramCache]: Analyzing trace with hash 75907902, now seen corresponding path program 1 times [2018-12-09 16:29:48,996 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:29:48,997 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:29:49,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:49,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:29:49,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:49,037 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:29:49,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:49,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:29:49,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:29:49,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:29:49,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:29:49,039 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand 3 states. [2018-12-09 16:29:49,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:49,220 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2018-12-09 16:29:49,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:29:49,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 16:29:49,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:49,221 INFO L225 Difference]: With dead ends: 139 [2018-12-09 16:29:49,221 INFO L226 Difference]: Without dead ends: 139 [2018-12-09 16:29:49,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:29:49,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-09 16:29:49,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2018-12-09 16:29:49,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-09 16:29:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2018-12-09 16:29:49,223 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 25 [2018-12-09 16:29:49,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:49,223 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2018-12-09 16:29:49,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:29:49,223 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2018-12-09 16:29:49,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 16:29:49,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:49,224 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:49,224 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-12-09 16:29:49,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:49,224 INFO L82 PathProgramCache]: Analyzing trace with hash -2039865847, now seen corresponding path program 1 times [2018-12-09 16:29:49,224 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:29:49,224 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:29:49,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:49,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:29:49,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:29:49,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 16:29:49,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 16:29:49,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-09 16:29:49,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 16:29:49,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 16:29:49,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-09 16:29:49,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-09 16:29:49,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:49,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2018-12-09 16:29:49,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-12-09 16:29:49,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-12-09 16:29:49,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:49,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:49,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:49,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 45 [2018-12-09 16:29:49,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:33 [2018-12-09 16:29:49,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-12-09 16:29:49,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-12-09 16:29:49,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:49,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:11 [2018-12-09 16:29:49,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:49,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:29:49,531 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:49,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:49,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:49,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:16 [2018-12-09 16:29:49,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:49,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:29:49,565 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:29:49,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:49,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:29:49,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 16:29:49,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 16:29:49,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 16:29:49,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 16:29:49,664 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,666 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,673 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:21 [2018-12-09 16:29:49,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-09 16:29:49,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:49,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 16:29:49,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-09 16:29:49,742 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:49,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 16:29:49,743 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,768 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:39 [2018-12-09 16:29:49,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-12-09 16:29:49,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:49,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:49,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:49,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-12-09 16:29:49,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-12-09 16:29:49,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:49,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:49,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:49,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-12-09 16:29:49,915 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,922 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,935 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:39 [2018-12-09 16:29:49,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 16:29:49,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-12-09 16:29:49,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 16:29:49,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-09 16:29:49,995 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:49,997 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:50,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:50,001 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:10 [2018-12-09 16:29:50,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:50,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:29:50,164 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:50,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:50,237 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:50,239 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:50,275 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:50,284 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:50,303 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:50,305 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:50,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 16:29:50,311 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:97, output treesize:25 [2018-12-09 16:29:50,382 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 16:29:50,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:50,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:50,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:53, output treesize:1 [2018-12-09 16:29:50,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:50,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 16:29:50,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 9, 7] total 23 [2018-12-09 16:29:50,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-09 16:29:50,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 16:29:50,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-12-09 16:29:50,402 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand 23 states. [2018-12-09 16:29:51,503 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-12-09 16:29:52,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:52,943 INFO L93 Difference]: Finished difference Result 188 states and 201 transitions. [2018-12-09 16:29:52,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 16:29:52,943 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 28 [2018-12-09 16:29:52,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:52,945 INFO L225 Difference]: With dead ends: 188 [2018-12-09 16:29:52,945 INFO L226 Difference]: Without dead ends: 188 [2018-12-09 16:29:52,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 83 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=308, Invalid=1098, Unknown=0, NotChecked=0, Total=1406 [2018-12-09 16:29:52,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-09 16:29:52,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 144. [2018-12-09 16:29:52,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-09 16:29:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2018-12-09 16:29:52,948 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 28 [2018-12-09 16:29:52,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:52,949 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2018-12-09 16:29:52,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-09 16:29:52,949 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2018-12-09 16:29:52,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 16:29:52,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:52,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:52,950 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-12-09 16:29:52,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:52,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1615706815, now seen corresponding path program 1 times [2018-12-09 16:29:52,950 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:29:52,950 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:29:52,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:53,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:29:53,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:29:53,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:53,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:53,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 16:29:53,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 16:29:53,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 16:29:53,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:53,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:53,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:53,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-12-09 16:29:53,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 16:29:53,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-09 16:29:53,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:53,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:53,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:53,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-09 16:29:53,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:53,078 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:29:53,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:53,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:29:53,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:29:53,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:29:53,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:29:53,081 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand 5 states. [2018-12-09 16:29:53,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:53,614 INFO L93 Difference]: Finished difference Result 206 states and 223 transitions. [2018-12-09 16:29:53,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:29:53,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-12-09 16:29:53,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:53,616 INFO L225 Difference]: With dead ends: 206 [2018-12-09 16:29:53,616 INFO L226 Difference]: Without dead ends: 206 [2018-12-09 16:29:53,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:29:53,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-09 16:29:53,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 143. [2018-12-09 16:29:53,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-09 16:29:53,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2018-12-09 16:29:53,618 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 28 [2018-12-09 16:29:53,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:53,618 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2018-12-09 16:29:53,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:29:53,618 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2018-12-09 16:29:53,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 16:29:53,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:53,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:53,619 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-12-09 16:29:53,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:53,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1615706814, now seen corresponding path program 1 times [2018-12-09 16:29:53,619 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:29:53,619 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:29:53,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:53,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:29:53,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:29:53,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:53,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:53,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 16:29:53,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 16:29:53,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 16:29:53,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:53,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:53,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 16:29:53,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 16:29:53,764 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:53,765 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:53,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:53,772 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-12-09 16:29:53,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 16:29:53,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 16:29:53,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:53,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:53,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 16:29:53,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-09 16:29:53,794 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:53,795 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:53,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:53,799 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-12-09 16:29:53,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:53,808 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:29:53,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:53,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:29:53,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:29:53,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:29:53,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:29:53,811 INFO L87 Difference]: Start difference. First operand 143 states and 154 transitions. Second operand 5 states. [2018-12-09 16:29:54,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:54,443 INFO L93 Difference]: Finished difference Result 227 states and 246 transitions. [2018-12-09 16:29:54,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:29:54,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-12-09 16:29:54,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:54,444 INFO L225 Difference]: With dead ends: 227 [2018-12-09 16:29:54,444 INFO L226 Difference]: Without dead ends: 227 [2018-12-09 16:29:54,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 16:29:54,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-12-09 16:29:54,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 142. [2018-12-09 16:29:54,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-09 16:29:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2018-12-09 16:29:54,447 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 28 [2018-12-09 16:29:54,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:54,447 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2018-12-09 16:29:54,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:29:54,447 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2018-12-09 16:29:54,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 16:29:54,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:54,447 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:54,448 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-12-09 16:29:54,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:54,448 INFO L82 PathProgramCache]: Analyzing trace with hash 4434480, now seen corresponding path program 1 times [2018-12-09 16:29:54,448 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:29:54,448 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:29:54,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:54,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:29:54,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 16:29:54,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-09 16:29:54,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:54,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:54,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:54,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-09 16:29:54,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:54,507 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:29:54,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:54,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:29:54,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:29:54,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:29:54,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:29:54,509 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 5 states. [2018-12-09 16:29:54,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:54,893 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-12-09 16:29:54,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:29:54,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-12-09 16:29:54,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:54,894 INFO L225 Difference]: With dead ends: 145 [2018-12-09 16:29:54,895 INFO L226 Difference]: Without dead ends: 145 [2018-12-09 16:29:54,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:29:54,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-09 16:29:54,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2018-12-09 16:29:54,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-09 16:29:54,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2018-12-09 16:29:54,896 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 29 [2018-12-09 16:29:54,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:54,897 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2018-12-09 16:29:54,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:29:54,897 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2018-12-09 16:29:54,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 16:29:54,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:54,897 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:54,897 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-12-09 16:29:54,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:54,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1805986873, now seen corresponding path program 1 times [2018-12-09 16:29:54,898 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:29:54,898 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:29:54,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:54,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:29:54,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:29:54,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:54,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:54,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 16:29:54,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:54,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:54,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 16:29:54,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:54,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:54,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-09 16:29:54,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-09 16:29:54,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 16:29:54,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:54,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:54,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:54,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:12, output treesize:4 [2018-12-09 16:29:54,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:29:54,990 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:29:54,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:54,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:29:54,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:29:54,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:29:54,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:29:54,992 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand 4 states. [2018-12-09 16:29:55,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:55,195 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2018-12-09 16:29:55,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 16:29:55,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-12-09 16:29:55,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:55,196 INFO L225 Difference]: With dead ends: 170 [2018-12-09 16:29:55,196 INFO L226 Difference]: Without dead ends: 170 [2018-12-09 16:29:55,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:29:55,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-09 16:29:55,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 141. [2018-12-09 16:29:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-09 16:29:55,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2018-12-09 16:29:55,199 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 30 [2018-12-09 16:29:55,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:55,199 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2018-12-09 16:29:55,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:29:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2018-12-09 16:29:55,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 16:29:55,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:55,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:55,200 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-12-09 16:29:55,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:55,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1185936324, now seen corresponding path program 1 times [2018-12-09 16:29:55,201 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:29:55,201 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:29:55,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:55,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:29:55,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:29:55,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 16:29:55,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:55,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:55,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 16:29:55,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-09 16:29:55,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 16:29:55,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 16:29:55,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-12-09 16:29:55,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-12-09 16:29:55,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-09 16:29:55,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:55,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-12-09 16:29:55,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-12-09 16:29:55,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-12-09 16:29:55,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 16:29:55,575 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:55,584 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-12-09 16:29:55,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 16:29:55,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:55,629 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:29:55,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 16:29:55,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:13 [2018-12-09 16:29:55,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 16:29:55,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 16:29:55,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 16:29:55,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 16:29:55,684 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,686 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,695 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-12-09 16:29:55,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-12-09 16:29:55,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-09 16:29:55,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-09 16:29:55,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-09 16:29:55,808 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,816 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:55,832 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-12-09 16:29:55,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-12-09 16:29:55,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 16:29:55,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 16:29:55,904 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-12-09 16:29:55,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 16:29:55,931 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-09 16:29:55,940 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,944 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:55,949 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-12-09 16:29:55,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:55,990 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:29:55,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:55,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-09 16:29:55,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 16:29:55,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 16:29:55,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-12-09 16:29:55,993 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 16 states. [2018-12-09 16:29:57,208 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-12-09 16:29:58,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:29:58,329 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2018-12-09 16:29:58,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 16:29:58,329 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-12-09 16:29:58,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:29:58,330 INFO L225 Difference]: With dead ends: 146 [2018-12-09 16:29:58,330 INFO L226 Difference]: Without dead ends: 146 [2018-12-09 16:29:58,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=318, Invalid=1088, Unknown=0, NotChecked=0, Total=1406 [2018-12-09 16:29:58,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-09 16:29:58,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 120. [2018-12-09 16:29:58,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-09 16:29:58,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2018-12-09 16:29:58,332 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 32 [2018-12-09 16:29:58,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:29:58,332 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2018-12-09 16:29:58,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 16:29:58,332 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2018-12-09 16:29:58,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 16:29:58,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:29:58,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:29:58,332 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-12-09 16:29:58,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:29:58,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1185936323, now seen corresponding path program 1 times [2018-12-09 16:29:58,333 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:29:58,333 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:29:58,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:29:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:29:58,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:29:58,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 16:29:58,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:58,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:58,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-09 16:29:58,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:58,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:58,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 16:29:58,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:58,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:58,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-09 16:29:58,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 16:29:58,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 16:29:58,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:58,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:58,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:58,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-12-09 16:29:58,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-12-09 16:29:58,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-09 16:29:58,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:58,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:58,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:58,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-12-09 16:29:58,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-12-09 16:29:58,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 16:29:58,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:58,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-12-09 16:29:58,641 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:58,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:58,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:58,652 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-12-09 16:29:58,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 16:29:58,691 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 16:29:58,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 36 [2018-12-09 16:29:58,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:58,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:58,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:31 [2018-12-09 16:29:58,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 16:29:58,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 16:29:58,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:58,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:58,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:58,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:43 [2018-12-09 16:29:58,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-12-09 16:29:58,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-09 16:29:58,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:58,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:58,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:58,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:56 [2018-12-09 16:29:58,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2018-12-09 16:29:58,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 16:29:58,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:58,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-12-09 16:29:58,949 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:29:58,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:29:58,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 16:29:58,971 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:63, output treesize:31 [2018-12-09 16:29:59,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:29:59,081 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:29:59,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:29:59,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-09 16:29:59,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 16:29:59,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 16:29:59,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-12-09 16:29:59,084 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand 17 states. [2018-12-09 16:30:05,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:30:05,856 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-12-09 16:30:05,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 16:30:05,856 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-12-09 16:30:05,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:30:05,857 INFO L225 Difference]: With dead ends: 151 [2018-12-09 16:30:05,857 INFO L226 Difference]: Without dead ends: 151 [2018-12-09 16:30:05,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=386, Invalid=1020, Unknown=0, NotChecked=0, Total=1406 [2018-12-09 16:30:05,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-09 16:30:05,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 119. [2018-12-09 16:30:05,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-09 16:30:05,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-12-09 16:30:05,860 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 32 [2018-12-09 16:30:05,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:30:05,860 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-12-09 16:30:05,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 16:30:05,860 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-12-09 16:30:05,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 16:30:05,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:30:05,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:30:05,860 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-12-09 16:30:05,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:30:05,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1420731406, now seen corresponding path program 1 times [2018-12-09 16:30:05,861 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:30:05,861 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:30:05,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:30:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:30:05,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:30:05,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 16:30:05,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 16:30:05,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:30:05,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:30:05,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:30:05,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 16:30:05,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 16:30:05,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-09 16:30:05,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:30:05,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:30:05,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:30:05,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-09 16:30:05,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:30:05,964 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 16:30:05,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:30:05,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:30:05,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:30:05,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:30:05,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:30:05,966 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 4 states. [2018-12-09 16:30:06,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:30:06,162 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2018-12-09 16:30:06,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 16:30:06,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-09 16:30:06,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:30:06,164 INFO L225 Difference]: With dead ends: 127 [2018-12-09 16:30:06,164 INFO L226 Difference]: Without dead ends: 127 [2018-12-09 16:30:06,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:30:06,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-09 16:30:06,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2018-12-09 16:30:06,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-09 16:30:06,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-12-09 16:30:06,165 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 35 [2018-12-09 16:30:06,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:30:06,165 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-12-09 16:30:06,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:30:06,165 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-12-09 16:30:06,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 16:30:06,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:30:06,166 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:30:06,166 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-12-09 16:30:06,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:30:06,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1765302171, now seen corresponding path program 1 times [2018-12-09 16:30:06,166 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:30:06,166 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:30:06,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:30:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:30:06,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:30:06,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-12-09 16:30:06,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-09 16:30:06,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:30:06,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:30:06,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-12-09 16:30:06,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-09 16:30:06,294 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:30:06,295 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:30:06,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:30:06,296 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:3 [2018-12-09 16:30:06,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 16:30:06,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 16:30:06,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:30:06,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:30:06,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 16:30:06,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 16:30:06,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:30:06,366 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:30:06,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:30:06,371 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-12-09 16:30:06,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:30:06,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:30:06,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:30:06,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:30:06,512 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:30:06,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:30:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:30:06,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:30:06,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-12-09 16:30:06,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-09 16:30:06,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:30:06,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:30:06,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-12-09 16:30:06,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-09 16:30:06,558 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:30:06,559 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:30:06,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:30:06,560 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:1 [2018-12-09 16:30:06,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 16:30:06,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 16:30:06,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:30:06,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:30:06,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 16:30:06,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 16:30:06,599 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:30:06,601 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:30:06,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:30:06,605 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-09 16:30:06,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:30:06,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:30:06,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:30:06,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 16:30:06,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9, 9] total 15 [2018-12-09 16:30:06,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 16:30:06,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 16:30:06,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-12-09 16:30:06,637 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 15 states. [2018-12-09 16:30:08,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:30:08,376 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2018-12-09 16:30:08,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 16:30:08,377 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-12-09 16:30:08,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:30:08,377 INFO L225 Difference]: With dead ends: 170 [2018-12-09 16:30:08,377 INFO L226 Difference]: Without dead ends: 170 [2018-12-09 16:30:08,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2018-12-09 16:30:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-09 16:30:08,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 132. [2018-12-09 16:30:08,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-09 16:30:08,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2018-12-09 16:30:08,379 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 36 [2018-12-09 16:30:08,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:30:08,379 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2018-12-09 16:30:08,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 16:30:08,379 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2018-12-09 16:30:08,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 16:30:08,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:30:08,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:30:08,380 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr19REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr50REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr52REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION]=== [2018-12-09 16:30:08,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:30:08,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1110206992, now seen corresponding path program 1 times [2018-12-09 16:30:08,381 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 16:30:08,381 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72e44d85-d0e8-48d5-a4be-4c304df172d0/bin-2019/utaipan/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 16:30:08,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:30:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 16:30:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 16:30:08,621 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 16:30:08,633 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-09 16:30:08,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:30:08 BoogieIcfgContainer [2018-12-09 16:30:08,648 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 16:30:08,648 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 16:30:08,648 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 16:30:08,648 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 16:30:08,648 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:29:41" (3/4) ... [2018-12-09 16:30:08,651 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 16:30:08,651 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 16:30:08,651 INFO L168 Benchmark]: Toolchain (without parser) took 27870.15 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 338.2 MB). Free memory was 938.0 MB in the beginning and 1.3 GB in the end (delta: -381.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:30:08,651 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:30:08,652 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -190.9 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2018-12-09 16:30:08,652 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:30:08,652 INFO L168 Benchmark]: Boogie Preprocessor took 23.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:30:08,652 INFO L168 Benchmark]: RCFGBuilder took 488.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. [2018-12-09 16:30:08,652 INFO L168 Benchmark]: TraceAbstraction took 27059.76 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -249.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:30:08,652 INFO L168 Benchmark]: Witness Printer took 2.97 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:30:08,653 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 273.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -190.9 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 488.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27059.76 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -249.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.97 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 985. Possible FailurePath: [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L988] null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L989] null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L990] null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L993] list->next = null VAL [list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L994] list->prev = null VAL [list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L995] list->colour = BLACK VAL [list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L997] struct TSLL* end = list; VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1031] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE null != end VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1034] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next VAL [end={-2:0}, end->next={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1041] end = end->next [L1032] COND FALSE !(null != end) VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1045] COND TRUE null != list VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1047] EXPR list->colour VAL [end={1:0}, list={-2:0}, list->colour=1, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1047] COND FALSE !(RED == list->colour) [L1056] EXPR list->next VAL [end={1:0}, list={-2:0}, list->next={1:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1056] end = list->next [L1057] free(list) VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1057] free(list) [L1058] list = end VAL [end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1045] COND FALSE !(null != list) VAL [end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] [L1062] return 0; VAL [\result=0, end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 147 locations, 67 error locations. UNSAFE Result, 27.0s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 21.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1626 SDtfs, 3611 SDslu, 3147 SDs, 0 SdLazy, 5453 SolverSat, 400 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 14.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 727 GetRequests, 502 SyntacticMatches, 10 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 582 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 552 NumberOfCodeBlocks, 552 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 617 ConstructedInterpolants, 34 QuantifiedInterpolants, 141628 SizeOfPredicates, 165 NumberOfNonLiveVariables, 2405 ConjunctsInSsa, 218 ConjunctsInUnsatCore, 26 InterpolantComputations, 18 PerfectInterpolantSequences, 8/22 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...